searching algorithm信息详情
检索算法
algorithm───n.算法，运算法则
searching───v.搜寻，查找；搜身，搜查；思索，细想（问题）；（在计算机或网络上）搜索（search的现在分词）；adj.搜索的，彻查的；透彻的；探寻性的（问题等）
asystole algorithm───心脏停搏算法
searching through───查遍；搜遍
supervised algorithm───有监督算法
searching engine───搜索引擎
algorism algorithm───算法
searching questions───搜索问题
privacy searching───隐私搜索
Finally the searching algorithm of optimal solution is presented.───并提出了求最优解的搜索算法。
On this basis, a practical crests searching algorithm of the window .───在此基础上提出一种实用的窗函数频谱峰值搜寻算法。
Slide window algorithm is a searching algorithm.───该滑窗算法是一种遍历性的算法。
The algorithm consists of two parts: a heuristic enclosed contour searching algorithm and a rule based depth fill-in algorithm.───该算法由启发式封闭轮廓搜索算法和基于规则的深度填充算法两部分组成。
Considering the essential difference between quantum bit and classical bit, this paper proposes a quantum binary searching algorithm.───考虑到量子比特与经典比特的本质区别，提出了一种量子二分检索算法。
To solve the depot-location of pro-environment vehicles, a Hybrid Random Searching Algorithm (HRSA) was presented.───针对环保车车场选址问题，提出了一种混合随机搜索算法（HRSA）。
The requirement of the running time and accuracy of the motion estimate searching algorithm for the mobile video communication is proposed.───先提出移动视频通信对运动估计搜索算法在运算时间和准确度上的要求。
Finally, a minimum area searching algorithm based on template matching is designed according to the own features of the system.───结合应用系统本身的特点，设计了基于模板匹配的最小区域搜索算法。
Ant colony optimization (ACO) is a new heuristic searching algorithm, which is inspired by the foraging behavior of the real ant colonies.───蚁群算法是根据真实蚁群的觅食原理提出的一种新兴的启发式搜索算法。
An information entropy based Reduct searching algorithm is proposed to benefit the applications of rough sets theory when it is used to small data set.
The heuristic searching algorithm maximizes the fitness of the additional constraint set, thereby reaches the final result that can satisfy the user's expectation.
After analyzing a DwPTS searching algorithm, this paper proposed a novel DwPTS searching algorithm based on the mean power decision principle. The algorithm is tested and emulated.
Block-by-block searching algorithm was improved on the basis of local search algorithm that based on critical block.
We also propose an efficient searching algorithm to reduce the execution time of block matching.
A fast searching algorithm based on the distribution of angular distance is provided.
The algorithm is a random searching algorithm in nature. It can converge to the global minima more probability and be adept in continuous functions optimization.
Finally, a particular description of a route searching algorithm is given based on graph data structure of an adjacency list.
Searching algorithm can be easily found in Petri net model.