binary search program 中文意思是什麼

binary search program 解釋
對分檢索法
  • binary : adj. 二,雙,復;【化學】二元的;【數學】二進制的。n. 二,雙,復;雙體,復體;【天文學】雙[聯]星【數學】二進制。
  • search : vt 1 搜查;檢查(身體、衣袋等);搜索,搜尋;找;尋找。2 調查;查究;探求;追求;根究 (into)。3...
  • program : 按遺傳密碼工作
  1. 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改進方案的有效性。
  2. The method in this paper provides a new approach to search perfect binary array pairs and quasi - perfect binary array pairs of big volume. it also can be used in the fast searching program for the sequences and arrays of other forms

    本文提出的方法為尋找大體積的最佳二進陣列偶和準最佳二進陣列偶提供了一種新的途徑,此方法還可以應用到對其它形式的序列或陣列的快速搜索程序中。
分享友人