The identification of the binary search algorithm is more efficient. This algorithm exposes information and has poor security.
二进制搜索算法虽然识别效率比较高，但是泄露信息比较多，安全性比较差。
Aiming at these problems, this paper presents a binary search algorithm based on solving the maximum module of roots of polynomial.
针对该问题，提出一种基于多项式根的最大模求解的二分搜索算法。
Owing to the improved binary search algorithm, 38% of transmission time was saved and the identification efficiency was greatly improved.
算法的改进使传输时间节省38%，大大提高了奶牛的识别效率。
Moreover, the performance analysis shows that the algorithm has more obvious advantages than the binary search algorithm and the dynamic binary search algorithm.
性能分析表明，该算法比已有的二进制及动态二进制反碰撞算法具有更明显的优势。
The elementary binary search algorithm and some im - proved algorithms are compared and analyzed quantified in detail, and a novel improved algorithm is proposed.
在对基本二进制搜索算法及其各种改进算法进行详细的定量分析的基础上提出了一种改进算法。
The elementary binary search algorithm and some improved algorithms were analyzed, and an adaptive anti-collision algorithm based on collision-tree (ACT) was proposed.
在对二进制搜索算法及其各种改进算法分析的基础上，提出了基于冲突树的标签自适应防碰撞算法(act)。
At the same time, recoverable dynamic binary search algorithm can narrow the scope of the search tag, thus greatly reducing communication time and data between reader and tags.
返回式二进制搜索算法可以缩小标签搜索范围，从而大大减少阅读器与标签之间的通信时间和传输的数据量。
This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree.
本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。
The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.
算法基于双向式搜索原理，采用投影法、夹角最小的方法及二叉树理论。
The algorithm takes advantage of the theories of bidirectional search, projection, minimum Angle and binary tree.
算法基于双向式搜索原理，采用投影法、夹角最小的方法及二叉树理论。
应用推荐