搜索樹 的英文怎麼說

中文拼音 [sōusuǒshù]
搜索樹 英文
search tree
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 2 （要; ...
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 搜索 : 1 （仔細尋找） search for; ferret about; hunt for; scout around 2 [電子學] hunting; scan; [控] in...
  1. By utilizing self - diagnosis method and diagnosis method based on dt, it become more convenience for fault orientation. considering about fuzzy relation between fault cause and symptom, commix fuzzy diagnosis module was set up by means of fuzzy synthesize judge

    將診斷樹應用於電噴發動機故障診斷專家系統可以優化搜索過程，實現對故障起因的最佳搜索。採用模糊綜合評判的方法進行模糊推理，有效地解決了故障原因與徵兆之間不確定性問題。
  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最小生成樹演算法自動生成屏內安裝接線圖和端子接線圖。
  3. 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

    以五子棋為例，提出了用遺傳演算法代替搜索樹法解決博弈問題的基本方案，並對適應度函數的設計作了一些有益地探索，給出了設計適應度函數應滿足的必要條件。
  4. 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叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。
  5. Two complete squence primers were designed based on the result of race. a 1475bp sequence was amplified by pcr. the analysis of the product shows that the nucleotide and deduced amino acid sequences share 40 % - 60 % homologous to the corresponding parts of - glc gene family of pinus contorta, cucurbita pepo, arabidopsis thaliana by the blast _ w program comparison

    經blast搜索表明：克隆所得堿基序列和推導的氨基酸序列與已克隆出的小松樹、西葫蘆擬南芥等植物體內-葡萄糖苷酶基因的cdna相應序列有40 ? 60的同源性，因此我們推斷擴增所得到的序列為茶樹中-葡萄糖苷酶基因的cdna 。
  6. For the sake of solving the search problem in community, we propose a search algorithm based on dominating set, combining category to organize lots of commodities, dividing commodities into different communities. the algorithm uses backbone network created by dominating set, combining informed k - walker search algorithm, to search commodity in community, which is proved to be more efficient

    同時，為了解決社區內搜索的問題，本文提出一種基於支配集的搜索演算法，結合分類樹組織海量的商品信息，將商品信息劃分到不同的社區中的方法，利用支配集形成的骨幹網，結合基於提醒的k - walker搜索策略，在社區內進行商品信息搜索，獲得了很好的效果。
  7. On the subtrees of random binary search trees

    隨機二叉搜索樹的子樹
  8. A binary search tree is a binary tree with the following properties

    二進制搜索樹（ bst ）是具有以下屬性的二進制樹：
  9. Binary search trees are useful for finding items in a list that changes infrequently

    二叉搜索樹在查找經常變化的列表時是很非常有用的。
  10. The algorithm provides the possibility of reducing the size of the search tree and running time

    該演算法從理論上提供了減小搜索樹的規模及運行時間的可能性。
  11. Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently

    二叉搜索樹在查找經常變化的列表時是很非常有用的。
  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. In order to make the recognition rapid a recognition model based on searching tree is proposed lots of experiments on it were done and the results proved what we proposed is possible

    為了提高識別時的速度，從理論上提出了一種基於搜索樹的識別模型，並對其可行性進行了一定的驗證。
  17. By introduction of derivative rule, derivative formula can be found ; through defining multi - dimension function space and reorganizing the function rules, the inaccuracy rules, and the end rules, the scope of formula finding is broadened ; by introduction of three - dimension expand rule and multidimensional expand rule, multi - dimension formulas can be discovered ; through improvement of flow of algorithm, more complete traverse has been achieved

    通過引入導數規則，可以發現導數公式；通過定義函數空間，重新組織函數規則，誤差規則，終止規則等知識，擴大了公式發現的廣度；引入多維擴展規則，可以發現多維函數公式；針對公式發現流程進行了改進，使得對搜索樹的遍歷更加完備。
  18. According to the basic idea of p - grid, peers exchange their information and split the search space when they meet each other. at last, each peer is only responsible for an interval of the whole search space and ma kes responses to the query requests for the data in this interval

    根據p - grid基本思想，節點間每次相遇就交換雙方的信息，對搜索空間不斷進行分割，使每個節點負責管理某一區間上數據信息並負責響應針對這些數據的查詢請求，最終搜索空間的劃分狀態在邏輯上可以用一棵二進制搜索樹表示。
  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

分享到臉書