binary search algorithm 中文意思是什麼
binary search algorithm
解釋
二分法檢索演算法-
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叉樹和樹作為信息數據處理的思想，大大提高了搜索引擎搜索的效率。 -
For a value, using a binary search algorithm
使用二進制搜索演算法在一維的排序 -
Compared with exhausitive search algorithm, the search amout is remarkable reduced by this algorithm and the algorithm is very efficiency. with the searched perfect binary array pairs and quasi - perfect binary array pairs, new perfect binary array pairs of high dimension and volume can be constructed by all kinds of construct methods
通過與窮舉搜索演算法的比較，本演算法大大減少了搜索數量，具有較高的效率。利用搜索得到的最佳二進陣列偶和準最佳二進陣列偶，可以用各種構造方法構造出新的高維和高階的最佳二進陣列偶。 -
According to the definitions of bottleneck bandwidth, available bandwidth and bulk transfer capacity, we analyzed the algorithms which named vps ( variable packet size ), pptd ( packet pair / train dispersion ), slops ( self - loading periodic streams ) and topp ( trains of packet pairs ) ; based on the principle of sub - path bottleneck measurement, we developed the bottleneck measurement algorithm using heterogenous packet - pair train ; after designing the three child algorithms ( demarcating bandwidth range, approaching bandwidth value and predicting the trendency of available bandwidth fluctuation ), we performed the algorithm called self - loading binary search ; applying the multi - home properties of sctp ( stream controltransmission protocol ) and measurement algorithm of available bandwidth, we presented a scheme to adjust the sctp transport path when there are network congestions or faults ; by the library of winsock and winpcap, we developed a measurement program to look for bottleneck bandwidth. in ns2 experiments, the algorithm based on heterogenous packet - pair train fitted well, and the algorithm of self - loading binary search worked quickly, and the sctp scheme improved the throughput effectively
本文根據瓶頸帶寬、可用帶寬和btc （ bulktransfercapacity ）三類網路帶寬定義，分析了vps （ variablepacketsize ）和pptd （ packetpair / traindispersion ）瓶頸帶寬測試演算法， slops （ self - loadingperiodicstreams ）和topp （ trainsofpacketpairs ）可用帶寬測試演算法;基於子路徑瓶頸測試原理，設計了異構包對序列的瓶頸測試演算法;並結合三個子演算法（界定帶寬范圍演算法、接近帶寬值演算法和帶寬變化趨勢判定演算法） ，設計了自載流折半查找的可用帶寬測試演算法;把上面的演算法應用到sctp （ streamcontroltransmissionprotocal ）的多宿性和可用帶寬測試，提出了一個網路擁塞或故障時調整sctp傳輸路徑的方案;結合winsock和winpcap兩套網路開發工具，設計了一個瓶頸帶寬測試程序;通過ns2模擬實驗，驗證了基於異構包對序列瓶頸測試演算法的準確性、自載流折半查找演算法的快速性，和sctp改進方案的有效性。 -
Cht - based scalable asymmetric binary search balancing algorithm
的可擴展非對稱二分查找平衡演算法 -
Uses a binary search algorithm to locate a specific element in the sorted
使用對分檢索演算法在已排序的 -
The second part is the search module. irobot revises the fish search algorithm by adding the analysis for the keyword in the context. with this revised fish algorithm which also uses the similarity relevance instead of binary e valuation, irobot crawls the web
2 、搜索部分： irobot系統從眾多的實時搜索演算法中選擇了fish演算法作為實現的核心，並對fish演算法做了改進，加入了關鍵字的上下文分析能力。 -
Another algorithm dba *, which represents the environment by dynamic binary trees and reduces the search range, is also proposed to optimize algorithm ba *. the simulation of soccer games shows time saving in real - time search and an optimal path planning. 4
在此基礎上，提出將二叉樹描述環境模型動態化，在搜索中隨著智能機器人的位置變化，動態地縮小廣東工業人學丁學博上學位論義其搜索范圍的osn 」 （動態一叉樹表示環境的srt 」演算法）演算法。
分享友人