If a fast search method such as binary searching is adopted, much faster searching can be realized.
如果采用诸如二分法搜索的快速搜索方法，则可实现更快的搜索。
When realizing high accuracy successive approximation ADC, the traditional binary searching algorithm is too simple to satisfy 16 bit ADC design requirement.
在实现高精度的逐次逼近ADC时，传统电荷重分布的二进制搜索算法过于简化，已经不能满足16位ADC设计的要求。
Simulation With C program and theoretical analysis show the improved adaptive binary searching algorithm is viable and has better system performance than the traditional algorithm.
通过C语言仿真和理论分析验证了本算法的可行性，并分析了本算法较传统算法的主要性能优势。
According to the collision cause of Radio Frequency Identification system, this paper analysis the work and principles of process of binary searching algorithm and dynamic binary searching algorithm.
然后根据射频识别系统碰撞产生的原因，研究分析了二进制搜索算法、动态二进制搜索算法的工作原理和过程。
They also provide searching for specific bytes, saving sections of a binary to disk, and much more.
他们还提供搜索特定字节，将部分二进制程序保存到磁盘，等等。
Time complexity and space complexity in searching binary complementary sequence pair are very huge because four sequences are involved in the calculation.
因为对二元互补序列偶的搜索涉及到四个序列的计算，搜索的时间复杂度和空间复杂度很大。
By making use of these properties and conditions, the searching efficiency for the almost perfect punctured binary sequence pairs can be improved significantly.
运用这些性质和条件可以缩小几乎最佳屏蔽二进序列偶的搜索范围，提高计算机搜索的效率。
Based on SPKI technology, proposing multicast distributed access control system: MDAC, as wall as, proposing a delegation certificate path (DCP) searching algorithm based on binary tree.
基于SPKI技术提出了组播分布式访问控制系统MDAC，并提出了基于二叉授权委托树的委托证书路径(DCP)查找算法。
Perhaps just as important are fundamental algorithms like binary search, graph searching algorithms, sorting algorithms, and tree-based searches such as minimax.
也许同样重要的是基本的算法，如二进制搜索，图形搜索算法，排序算法，并基于树的极小搜索。
Focusing on the problems of the resource searching in P2P network, a P2P network model based on strictly binary tree is proposed.
针对P 2 P网络中资源查找以及其自身存在的问题，提出了一种基于二叉树的P 2 P网络模型。
The threaded binary tree based on the new algorithm is superior to the traditional one, and thus makes the WBS searching simpler and more effectual.
新算法生成的线索二叉树比传统的线索二叉树优越，从而使WBS搜索更加简单、有效。
This paper presents a new algorithm for searching the connective regions in the binary image based on the matching between the up contour and down contour points.
基于上下边缘点匹配的连通域搜索算法利用连通域的上下边缘点是一一对应的这一基本原理 ，设计出新的高效二值图像连通域搜索方法 。
Binary code usually deals with searching for optimization in Genetic Algorithms(GA). BCD code is used to solve optimization problem.
遗传算法中二进制编码通常用来解决最优解问题，引入了BCD编码来解决最优解问题。
This paper presents an improved algorithm for searching connected area in binary image.
本文分析了几个相关的算法，并指出其优劣点，提出了一个八连通区域提取算法。
This paper presents an improved algorithm for searching connected area in binary image.
本文分析了几个相关的算法，并指出其优劣点，提出了一个八连通区域提取算法。
应用推荐