樹搜索 的英文怎麼說

中文拼音 [shùsōusuǒ]
樹搜索 英文
tree searching
  • 樹 : Ⅰ名詞1 （木本植物的通稱） tree 2 （姓氏） a surname Ⅱ動詞1 （種植; 栽培） plant; cultivate 2 （樹...
  • 搜 : 動詞1. （尋找） collect; gather2. （搜查） search; ransack
  • 索 : Ⅰ名詞1 （大繩子; 大鏈子） a large rope 2 （姓氏） a surname Ⅱ動詞1 （搜尋; 尋找） search 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. With applying dsst algorithm, mobile agent can solve the problem of selecting router. synthesizing advantages of centralized search engine and distributed search engine, through it that system obtains the best way that agents mobile does. after statistics analysis, the author gets the mathematic pattern that mobil agent clones right times

    利用idl語言定義了agent在多種平臺上移動的介面，設計了一個符合maf規范的插件，實現agent在異種平臺之間的移動；利用動態最小生成樹演算法解決移動agent的路由選擇問題，綜合集中式搜索和分散式搜索的特點，動態尋找出一條agent移動的最佳路線；通過統計分析得到移動agent克隆的數學模型，通過計算可以獲得agent克隆個數的最佳值。
  8. This makes prbfm a promising emerging game - tree search algorithm in future chip multiprocessor platforms

    這使得prbfm成為將來多核處理器（ cmp ）多線程游戲樹搜索benchmark的一個有力的備選演算法。
  9. 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 ）一直以來在人工智慧領域扮演著極其重要的角色，并行游戲樹搜索更是該領域的熱點研究問題。
  10. This method can be used not only for search space of left - deep but also for hybrid search spaces

    該方法不僅可用於左深度樹搜索空間，同樣適用於混合搜索空間。
  11. The proposed classification method consists of two key processing stages : the improved constrained search on an interpretation tree and the following shape similarity measure computation

    所提的物體分類方法主要包括2個核心處理模塊，即改進的約束解釋樹搜索和形狀相似性度量計算。
  12. This paper sets forth the two methods for topology analysis : neighboring matrix method and tree _ search method, which are in common use

    本文詳細地闡述了網路拓撲分析中兩種常用的分析方法：鄰接矩陣法和樹搜索法。
  13. The provider uses a subtree search starting at the search point specified in the connection string

    提供程序從連接字元串中指定的搜索點開始執行子樹搜索。
  14. In the problems of minimax tree search, what we are looking for is often the optimal branch at the root node

    在極大極小樹搜索時，我們經常尋找的是根節點的最優分支。
  15. All other operations, including any search methods, perform subtree searches rooted at the container

    所有其他操作（包括所有搜索方法） ，都以該容器作為根來執行子樹搜索。
  16. The provider uses a subtree search starting at the search point specified in the connection string to determine whether a user exists

    提供程序從連接字元串中指定的搜索點開始執行子樹搜索，以確定用戶是否存在。
  17. 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平臺設計多核處理器提供了一些數據支持。
  18. Combining the orientation of searching the route and the decisive position of links and nodes, this paper proposes an orientated tree algorithm of efficient paths by simulating the tree ' s growing

    文章將交通路網中節點位置的確定性與交通出行中路徑選取的有向性相結合，模擬樹的生長，提出了一種有效路徑的定向樹搜索演算法。
  19. 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演算法與隱式圖的優化搜索，隱式圖搜索與隱式樹搜索全部統一到同一個模型和演算法中去。
  20. 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

    摘要為了說明如何利用啟發式信息構造車間調度的約束滿足求解演算法，首先概述了常規約束滿足求解技術，進而介紹了車間調度問題的約束傳播演算法、樹搜索演算法和啟發式修復演算法的構造原理及適用性。
分享友人
分享到 Line

分享到臉書