樹查找演算法 的英文怎麼說

中文拼音 [shùzhāzhǎoyǎnsuànfǎ]
樹查找演算法 英文
tree finding algorithm
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 查 : 查名詞1. [植物學] （山查） hawthorn; haw2. （姓氏） a surname
  • 找 : 動詞1 （尋找）look for; try to find; discover; seek 2 （退還余錢） give change 3 （求見; 查找） a...
  • 演 : 動詞1 （演變; 演化） develop; evolve 2 （發揮） deduce; elaborate 3 （依照程式練習或計算） drill;...
  • 算 : Ⅰ動詞1 （計算數目） calculate; reckon; compute; figure 2 （計算進去） include; count 3 （謀劃;計...
  • 法 : Ⅰ名詞1 （由國家制定或認可的行為規則的總稱） law 2 （方法; 方式） way; method; mode; means 3 （標...
  • 查找 : [自動化] seek查找服務 service-seeking; 查找區域 [計算機] seek area; 查找時間 [自動化] search time; seek time
  1. 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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  2. 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匯編語言層次上對所有的演算法加以實現。
  3. At the same time, three region segmentation algorithms also are introduced, i. e. global - based segmentation algorithm, tree - based region find in rle map image, and statistic - based region feature computation algorithm

    同時在目標區域合併（分割）階段，提出了基於全局掃描的分割演算法、行程編碼圖中基於樹的區域查找演算法和基於統計的區域特徵量計算方法。
  4. A new heuristic search method is devised for maximum likelihood method, which first constructs a starting tree, and then through branch swapping searches for trees best resembling the present optimal tree and locates a better tree. repeat this process, till no more better trees are generated or the upper iteration limit is arrived and the program ends

    對最大似然法，改進了一種新的啟發式搜索:隨機建立一棵初始樹，然後通過查看與當前最優樹拓撲最近的樹，從中尋找更優樹，不斷地更新當前最優樹，直到無法找到更優樹或者達到了搜索次數的上限，演算法停止。
分享友人
分享到 Line

分享到臉書