tree search algorithm 中文意思是什麼
tree search algorithm
解釋
樹檢索演算法-
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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。 -
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環鄰域搜索顯示出較好的優勢，實現了三角網格模型的快速拓撲重建。 -
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的一個有力的備選演算法。 -
The algorithm provides the possibility of reducing the size of the search tree and running time
該演算法從理論上提供了減小搜索樹的規模及運行時間的可能性。 -
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
實驗表明，用遺傳演算法所設計的對弈程序優于搜索樹法。 -
E3d r - tree takes into account the features of moving object data and takes advantage of new cost parameters. in particular, least - cost - first search algorithm is used in the insertion algorithm to find the overall best way to insert a new record in e3d r - tree. the proof of the vidility of the algorithm is given
在e3dr - tree中，結合移動對象數據特徵引入空白區域作為新的插入代價參數，同時，在插入演算法中利用最小代價優先搜索演算法確定全局最優插入路徑，並給出演算法正確性證明。 -
The creativity of the work in the paper can be shown as the following four aspects : ( 1 ) for single subnet, the condition of simple link judgement is added into the ptda, so the algorithm is improved well ; ( 2 ) for multiple subnets, the ptda becomes more effective, benefited from use of breadth - first - search algorithm of graph, port - deletion method etc ; ( 3 ) due to suitable adoption of the three protocols stp, snmp and arp, the ptda based on spanning tree protocol can get very effective and correct ; ( 4 ) owing to the employment of ieee802. 1 q, the ptda of vlan is all - purpose to some extent
本文的創新之處主要體現在以下四個方面:在單子網物理拓撲發現演算法中，增加了判斷簡單連接的條件，使演算法更加完善;在多子網物理拓撲發現演算法中採用圖的廣度優先遍歷方法、埠刪除方法等，該演算法更加有效;在生成樹協議物理拓撲發現演算法中，正確使用stp 、 snmp和arp三種協議，物理拓撲發現非常準確;在vlan物理拓撲發現演算法中，正確運用了ieee802 . 1q協議，該演算法具有通用性。 -
After researching deep into the building and combination on model based on database, the author puts forth a search algorithm of data mining by use of prototype library and a data - clustering algorithm on the basis of expanded cf - tree
本文對基於數據庫的模型生成和模型組合作了較深入的研究，給出了基於原型庫的數據開采搜索演算法和基於擴充cf -樹數據聚類演算法。 -
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
該演算法用團的簡單啟發式演算法提供下界；用加權著色的啟發式演算法提供上界；在分支階段，每次只產生一個新的子問題，並利用著色信息來選擇分支頂點；最後利用回溯法來檢驗整體最優性。 -
So this article put forward a theory that the optimal problems can be summed up to the mathematic and computing models of state space search of optimal problems. this conclusion unifies the dijstra algorithm used in finding shortest path of traditional explicit graphs and the optimal search of implicit graphs, the search of graph and the search of graphs " tree into a common model and algorithm
本文提出了將優化問題歸結為狀態空間最優化搜索問題的數學模型和通用演算法，將傳統的在顯式圖中求最短路的dijstra演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。 -
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
該演算法以各時段的累計需求為根節點建立搜索樹，從而將帶折扣的庫存問題轉化為典型的動態批量問題，運用動態規劃法即可求解。 -
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
摘要為了說明如何利用啟發式信息構造車間調度的約束滿足求解演算法，首先概述了常規約束滿足求解技術，進而介紹了車間調度問題的約束傳播演算法、樹搜索演算法和啟發式修復演算法的構造原理及適用性。 -
A new data structure frequent tree is constructed, which stores crucial information of frequent item. and an algorithm of mining frequent itemsets is presented based on the frequent tree, which can avoid repeated databases scans and a huge candidate itemsets generation, and can dramatically reduce the search space
第三章構造了一個新的數據結構頻繁樹，用以存儲頻繁項集的重要信息，並給出了基於該頻繁樹的頻繁集的挖掘演算法，該方法能夠避免重復掃描數據庫，避免產生大量的候選集，大大地減少搜索空間。
分享友人