Aiming at these problems, this paper presents a binary search algorithm based on solving the maximum module of roots of polynomial.
针对该问题，提出一种基于多项式根的最大模求解的二分搜索算法。
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.
返回式二进制搜索算法可以缩小标签搜索范围，从而大大减少阅读器与标签之间的通信时间和传输的数据量。
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.
返回式二进制搜索算法可以缩小标签搜索范围，从而大大减少阅读器与标签之间的通信时间和传输的数据量。
应用推荐