search tree 中文意思是什麼

search tree 解釋
檢索樹, 查找樹
  • search : vt 1 搜查；檢查（身體、衣袋等）；搜索，搜尋；找；尋找。2 調查；查究；探求；追求；根究 （into）。3...
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木，也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  1. Motivated by this observation, this paper studies the problem of efficiently processing k nn k - ge 1 search on r - tree - like structures storing historical information about moving object trajectories. two algorithms are developed based on best - first traversal paradigm, called bfp k nn and bft k nn, which handle the k nn retrieval with respect to the static query point and the moving query trajectory, respectively. both algorithms minimize the number of node access, that is, they perform a single access only to those qualifying nodes that may contain the final result

    例如，若已知動物的軌跡，則動物學家可能提出如下兩種查詢： i在時間區間ti ， tj內找到離一個給定的靜態點譬如食物源實驗室等最近的k條動物軌跡ii在時間區間ti ， tj內找到離一條預先指定的動物軌跡最近的k條動物軌跡。
  2. Two amateur california naturalists found the tree earlier this summer during a bushwhacking expedition in search of tall trees

    人們以希臘神話中的亥伯龍神為這棵紅杉命名，它高378 . 1英尺（ 115 . 2米） ，比之前的世界紀錄保持者高出2米2 。
  3. The tree called hyperion stands at 378. 1 feet, eight feet taller than the previous record holder, another coast redwood dubbed stratosphere giant in a state park about 90 miles south. two amateur california naturalists found the tree earlier this summer during a bushwhacking expedition in search of tall trees

    人們以希臘神話中的亥伯龍神為這棵紅杉命名，它高378 . 1英尺115 . 2米，比之前的世界紀錄保持者高出2米2 。
  4. Firstly, the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type. secondly, the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm, and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention. finally, the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward, this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically

    首先，採用廣度優先搜索演算法查找電氣原理圖中的連通導線端點集，並根據不同類型的繼電元件對應的cad圖塊結構的不同，得到電氣原理圖中元件接線端子之間的連接關系;其次，根據二分圖匹配演算法為電氣原理圖中繼電元件選擇合適的型號和規格，並採用人工干預和自動布置相結合的方法完成屏面布置圖的自動生成;最後，提出了完全無向圖中經過每個頂點一次且僅一次的優化路徑演算法，利用該演算法和經過預處理的prim最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  5. Taking gobang as an example, this paper proposes the base scheme for solve game problem by adopting the notion of genetic algorithms instead of search tree, and makes some exploratory work on the design of fitness function, it also provides with requirements for designing fitness function

    以五子棋為例，提出了用遺傳演算法代替搜索樹法解決博弈問題的基本方案，並對適應度函數的設計作了一些有益地探索，給出了設計適應度函數應滿足的必要條件。
  6. Then, the associated search optimal algorithm based on virtual avl tree is promoted to rapidly reconstruct the half - edge topological structure. 3. to rebuild the tooth surface from the littery measure data, the membrane deformation algorithm based on loop subdivision is given to fit density triangle meshes to subdivision surface

    前者巧妙、高效地完成了去除冗餘點的工作，將stl數據的存儲尺寸壓縮為原來的18 % 25 % ;後者完成了數據的半邊拓撲重建，使得后續對于邊界邊搜索、 1環鄰域搜索顯示出較好的優勢，實現了三角網格模型的快速拓撲重建。
  7. In this paper, a lot of researches and exploration are applied to studying the universality and expansibility of hardware and the arithmetic design and code optimization of software. especially, all of the following arithmetics or conceptions are worked out in the research of software design : self - adaptable compression arithmetic based on dictionary model for data collection system, similarity full binary sort tree, a optimized quick search arithmetic and an improved arithmetic of multiplication in the floating - point operation. and all of the arithmetic are designed with mcs - 51 assembly language. the quick search arithmetic, in which merits of both binary search and sequence search are used fully, are based on the specialty of preorder traversal in similarity full binary sort tree

    特別在軟體設計研究中，提出了適用於數據採集系統的數據壓縮演算法? ?基於字典模型的自適應壓縮演算法；提出了類滿二叉排序樹的定義；提出了基於類滿二叉排序樹的先序遍歷特性的最優化快速查找演算法，它充分利用了折半查找和順序查找各自的優點；提出了浮點運算乘法的改進演算法；並在mcs - 51匯編語言層次上對所有的演算法加以實現。
  8. First, we have expatiated the working principle, performance parameters and major technologies. farther, we have analyzed the shortcomings of the existing catalog search engine and introduced the clustering analysis and the ant algorithm ; on the basis of this, we discussed the possibility and necessity of the connection between them, which avoids the local optimization of the clustering analysis to a degree. in the end, we appraise the idea that we deal with the information data by the data structure of the binary tree, m - branch tree and tree established by the ant algorithm, which can improve the efficiency of the search engine

    首先闡述了搜索引擎的工作原理，性能指標，主要技術；分析了現有目錄式搜索引擎的缺點，接著介紹了聚類分析演算法與螞蟻演算法的理論，並論述了二者結合的可能性和必要性，這種結合方法也在一定程度上克服了聚類分析演算法容易陷入局部最優的缺點，最終提出了通過使用螞蟻演算法建立二叉樹、 m叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。
  9. This makes prbfm a promising emerging game - tree search algorithm in future chip multiprocessor platforms

    這使得prbfm成為將來多核處理器（ cmp ）多線程游戲樹搜索benchmark的一個有力的備選演算法。
  10. A binary search tree is a binary tree with the following properties

    二進制搜索樹（ bst ）是具有以下屬性的二進制樹：
  11. The algorithm provides the possibility of reducing the size of the search tree and running time

    該演算法從理論上提供了減小搜索樹的規模及運行時間的可能性。
  12. Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game

    摘要解決博弈問題的傳統演算法搜索樹法所無法克服的對搜索深度的限制。
  13. The experimentation proves that the game procedure designed by genetic algorithm outweighs that designed by search tree

    實驗表明，用遺傳演算法所設計的對弈程序優于搜索樹法。
  14. The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the binary tree

    在此基礎上，信息的搜索就可描述為二進制搜索樹的查找過程。
  15. Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem

    用一個二叉搜索樹或者將串切分成長度的平方根那麼長的小段都可以解決這個問題。
  16. Digital search tree

    數字查找樹
  17. Binary search tree

    二叉查找樹
  18. The algorithm applies a simple clique finding and weighted coloring to determine lower and upper bounds, and actives exactly one new search tree node at each branching stage which using the information obtained in the weighted coloring to choose a branching vertex, and uses backtracking method to obtain optimum solution

    該演算法用團的簡單啟發式演算法提供下界；用加權著色的啟發式演算法提供上界；在分支階段，每次只產生一個新的子問題，並利用著色信息來選擇分支頂點；最後利用回溯法來檢驗整體最優性。
  19. In the above example, a simple hashmap or binary search tree could have easily solved the problem, but implementing one of these data structures in xsl would be inconvenient and unnecessary

    在上面的示例中，如果使用一個簡單的散列圖（ hashmap ）或二進制搜索樹就可以輕易地解決問題，但是用xsl實現一個這樣的數據結構並不是很方便，並且是不必要的。
  20. In the algorithm, a search tree with roots of the cumulative demands in the corresponding period is taken as the roots of the search tree, transforming the quantity discount problem into dynamic order quantity ( doq ) problem that is solvable with a dynamic programming algorithm

    該演算法以各時段的累計需求為根節點建立搜索樹，從而將帶折扣的庫存問題轉化為典型的動態批量問題，運用動態規劃法即可求解。
分享友人
分享到 Line

分享到臉書