tree search 中文意思是什麼
tree search
解釋
恃索-
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條動物軌跡。 -
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 。 -
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 。 -
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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。 -
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
以五子棋為例，提出了用遺傳演算法代替搜索樹法解決博弈問題的基本方案，並對適應度函數的設計作了一些有益地探索，給出了設計適應度函數應滿足的必要條件。 -
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環鄰域搜索顯示出較好的優勢，實現了三角網格模型的快速拓撲重建。 -
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匯編語言層次上對所有的演算法加以實現。 -
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叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。 -
This makes prbfm a promising emerging game - tree search algorithm in future chip multiprocessor platforms
這使得prbfm成為將來多核處理器（ cmp ）多線程游戲樹搜索benchmark的一個有力的備選演算法。 -
Game - tree search plays an important role in the field of artificial intelligence. in this paper we characterize and compare two parallel game - tree search workloads in chess on two intel xeon
游戲樹搜索（ game - treesearch ）一直以來在人工智慧領域扮演著極其重要的角色，并行游戲樹搜索更是該領域的熱點研究問題。 -
A binary search tree is a binary tree with the following properties
二進制搜索樹（ bst ）是具有以下屬性的二進制樹： -
The algorithm provides the possibility of reducing the size of the search tree and running time
該演算法從理論上提供了減小搜索樹的規模及運行時間的可能性。 -
Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently
二叉搜索樹在查找經常變化的列表時是很非常有用的。 -
Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game
摘要解決博弈問題的傳統演算法搜索樹法所無法克服的對搜索深度的限制。 -
The experimentation proves that the game procedure designed by genetic algorithm outweighs that designed by search tree
實驗表明，用遺傳演算法所設計的對弈程序優于搜索樹法。 -
In the problems of minimax tree search, what we are looking for is often the optimal branch at the root node
在極大極小樹搜索時，我們經常尋找的是根節點的最優分支。 -
This thesis discloses some key workload characteristics of tree search applications in some sense, while gives some data support to design intel platform ’ s chip multprocessor
本文在一定程度上揭示了并行樹搜索程序在smp平臺上的關鍵負載特徵，為intel平臺設計多核處理器提供了一些數據支持。 -
The sequences are transformed to a relative sequence, in which all the segments are normalized by the previous segment. the relative sequences are categorized and indexed by suffix tree, and the result of the suffix tree search is the potential similar subsequences
通過將序列變換為相對序列，實現了對序列中任意位置、任意長度子序列的規范化；為了提高查詢效率，將相對序列的特徵向量進行離散化分類，並使用后綴樹進行索引。 -
To explain how to use the heuristics information of the problem to construct constraint - based solving algorithm, the general constraint satisfaction solving technology was briefly introduced, then the principles and the applicability of constraint propagation algorithm, tree search algorithm and heuristics repair algorithm for job shop scheduling were summarized
摘要為了說明如何利用啟發式信息構造車間調度的約束滿足求解演算法，首先概述了常規約束滿足求解技術，進而介紹了車間調度問題的約束傳播演算法、樹搜索演算法和啟發式修復演算法的構造原理及適用性。 -
Conduct a tree search. ask people to find large, unusual or historic trees in your community. tell people to take care of them
組織一次尋找珍貴樹木的活動，讓人們發現社區內的參天大樹、罕見的樹或者具有歷史意義的樹木，號召人們保護好這些樹。
分享友人