best-first search 中文意思是什麼
best-first 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條動物軌跡。 -
Shared - memory multiprocessor systems. one is a recently - proposed parallel randomized best - first minimax search ( prbfm ) algorithm in a chess - playing program, and the other is the latest version of crafty, a state - of - the - art alpha - beta - based chess - playing program whose older sequential version is known as a typical game program in spec2000
演算法一是最近新出的parallelrandomizedbest - firstminimaxsearch （ prbfm ） ，演算法二是著名的開源棋類游戲crafty採用的dynamictreesplitting演算法，其早期的單線程版本是spec2000benchmark測試cpu整數性能的程序之一。 -
In this text, we first do some research on the genetic algorithm about clustering, discuss about the way of coding and the construction of fitness function, analyze the influence that different genetic manipulation do to the effect of cluster algorithm. then analyze and research on the way that select the initial value in the k - means algorithm, we propose a mix clustering algorithm to improve the k - means algorithm by using genetic algorithm. first we use k - learning genetic algorithm to identify the number of the clusters, then use the clustering result of the genetic clustering algorithm as the initial cluster center of k - means clustering. these two steps are finished based on small database which equably sampling from the whole database, now we have known the number of the clusters and initial cluster center, finally we use k - means algorithm to finish the clustering on the whole database. because genetic algorithm search for the best solution by simulating the process of evolution, the most distinct trait of the algorithm is connotative parallelism and the ability to take advantage of the global information, so the algorithm take on strong steadiness, avoid getting into the local
本文首先對聚類分析的遺傳演算法進行了研究，討論了聚類問題的編碼方式和適應度函數的構造方案與計算方法，分析了不同遺傳操作對聚類演算法的性能和聚類效果的影響意義。然後對k - means演算法中初值的選取方法進行了分析和研究，提出了一種基於遺傳演算法的k - means聚類改進（混合聚類演算法） ，在基於均勻采樣的小樣本集上用k值學習遺傳演算法確定聚類數k ，用遺傳聚類演算法的聚類結果作為k - means聚類的初始聚類中心，最後在已知初始聚類數和初始聚類中心的情況下用k - means演算法對完整數據集進行聚類。由於遺傳演算法是一種通過模擬自然進化過程搜索最優解的方法，其顯著特點是隱含并行性和對全局信息的有效利用的能力，所以新的改進演算法具有較強的穩健性，可避免陷入局部最優，大大提高聚類效果。 -
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中，結合移動對象數據特徵引入空白區域作為新的插入代價參數，同時，在插入演算法中利用最小代價優先搜索演算法確定全局最優插入路徑，並給出演算法正確性證明。 -
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
對最大似然法，改進了一種新的啟發式搜索:隨機建立一棵初始樹，然後通過查看與當前最優樹拓撲最近的樹，從中尋找更優樹，不斷地更新當前最優樹，直到無法找到更優樹或者達到了搜索次數的上限，演算法停止。 -
Best - first search
最佳優先搜索 -
In the course of designing reasoning machine, this article uses forward inference and the tactics of best - first search. and in connection with much of fuzzy knowledge, it introduces confidence theory to infer the formula of confidence which propagate in and / or tree, and illustrates how to calculate the confidence when it propagate in the course of automobile components failure analysis reasoning
在推理機的編制過程中，本文採用了正向推理方法及最好優先搜索策略，同時針對知識庫中大量的模糊知識，本文引入了可信度推理模型，推導了可信度在與或樹中傳播計算公式，並舉例說明了在汽車零部件失效分析推理過程中可信度的傳播計算方法。
分享友人