binary search 中文意思是什麼

binary search 解釋
對半檢索
  • binary : adj. 二，雙，復；【化學】二元的；【數學】二進制的。n. 二，雙，復；雙體，復體；【天文學】雙[聯]星【數學】二進制。
  • search : vt 1 搜查；檢查（身體、衣袋等）；搜索，搜尋；找；尋找。2 調查；查究；探求；追求；根究 （into）。3...
  1. An effective method of searching an ordered list of entries is the so-called binary search or logarithmic search method.

    查幾個登記項的有序表的一種有效方法就是所謂的折半查找或稱對數查找。
  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. On the subtrees of random binary search trees

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

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

    二叉搜索樹在查找經常變化的列表時是很非常有用的。
  6. Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently

    二叉搜索樹在查找經常變化的列表時是很非常有用的。
  7. 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

    在此基礎上，信息的搜索就可描述為二進制搜索樹的查找過程。
  8. 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

    用一個二叉搜索樹或者將串切分成長度的平方根那麼長的小段都可以解決這個問題。
  9. For a value, using a binary search algorithm

    使用二進制搜索演算法在一維的排序
  10. If the search is time - critical, a binary search or hash table lookup is almost always best, but as with sorting, you must keep locality in mind

    如果搜索是時間關鍵的，二進制搜索或者哈希表查找幾乎總是最好的，但是與排序一樣，必須記住地址。
  11. Binary search tree

    二叉查找樹
  12. To validate the performance of the proposed scheme, the scheme is simulated with fpga, and the simulation result indicates that compared with the conventional pn acquisition schemes, the pn acquisition using auxiliary sequence and binary search can decrease the acquisition time greatly on the same condition

    同時，為了進一步驗證該同步捕獲方案的捕獲性能，文中採用fpga器件對捕獲方案進行模擬，分析結果表明：與傳統的序列捕獲方案相比，基於輔助序列和二分法的同步捕獲方案可以在系統復雜度和性能不變的前提下，大大縮短捕獲時間，實現擴頻序列的快速捕獲。
  13. In the process of developing software, the " binary search " is used to search the " character model " of the characters displayed. the display quality is improved by this means. the real - time process of tester is kept by the method called " time - interrupt "

    在軟體程序的設計中，採用「折半查找」的快速查找方法完成對顯示字元「字模」的查找，改善顯示畫面的質量；採用「定時中斷」的方法保證了測試儀進行參數測量時的實時性。
  14. 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改進方案的有效性。
  15. Cht - based scalable asymmetric binary search balancing algorithm

    的可擴展非對稱二分查找平衡演算法
  16. Uses a binary search algorithm to locate a specific element in the sorted

    使用對分檢索演算法在已排序的
  17. This method performs a binary search ; therefore, this method is an o log

    此方法執行二進制搜索；因此，此方法是運算復雜度為o （ log
  18. Binary search performing a binary search requires that the elements in the array be sorted

    二進制搜索執行二進制搜索要求數組中的元素已經排序。
  19. Add and remove operations are typically expensive since binary search trees require that a tree be balanced

    通常需要增加和刪除操作，因為二叉樹需要被平衡。
  20. 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實現一個這樣的數據結構並不是很方便，並且是不必要的。
分享友人
分享到 Line

分享到臉書