您要查找的是不是：
- For a value, using a binary search algorithm. 使用二进制搜索算法在一维的排序。
- Then it designs and realizes the fast rampart search algorithm. 其中,平面点集的凸壳是最重要、最基础的问题。
- Which uses a linear search algorithm to find entries in the list of delegates. 类型,它使用线性搜索算法在委托列表中查找项。
- Before the message is relayed, the routing component of the categorizer must select the least cost routing path. 在中继此邮件之前,分类程序的路由组件必须选择开销最低的路由路径。
- This code has demonstrated Ma Zouri the checkerboard search algorithm. 本代码演示了马走日棋盘搜索算法。
- The hub site must exist along the least cost routing path between the source and target servers. 中心站点必须在源服务器与目标服务器之间开销最低的路由路径上。
- Exactly tracking the maximum power point depends on effective search algorithm. 准确跟踪太阳能光伏阵列的最大输出功率点依赖于有效的搜索算法。
- The least cost routing path is also used if a message cannot be delivered to the target site. 如果无法将邮件传递到目标站点,也将使用开销最少的路由路径。
- Genetic algorithm and Tabu Search Algorithm are combined in our method. 并比较了新算法与三种经典全局优 化算法的性能。
- We solemnly promise to customers at the least cost were most satisfied with the results. 我们郑重承诺，让顾客以最少的花费获得最满意的效果。
- The search algorithm rummages through a database with entries in random order. 搜寻算则会在资料库的条目中随意翻找。
- Any messages that exceed the maximum message size limit on any routing group connector in the least cost routing path won't be delivered. 对于超过最小开销路由路径内任何路由组连接器上最大消息大小限制的任何消息,都不予以发送。
- Simulation shows that the algorithm can obtain less cost and mean path delay, it also has low time complexity. 仿真结果表明,该算法得到的多播路由树具有较小的费用,平均路径延迟也比较小,并且避免了其它同类算法的高复杂性。
- Any message size limits that are specified on a routing group connector don't affect the selection of the least cost routing path. 对路由组连接器指定的任何消息大小限制都不会影响最小开销路由路径的选择。
- Any message size limits that are specified on an Active Directory site link don't affect the selection of the least cost routing path. 对Active Directory站点链接指定的任何消息大小限制都不会影响最小开销路由路径的选择。
- First, calculate the least cost routing path by adding the cost of the IP site links that must be traversed to reach the destination. 首先,通过将通向目标必须经过的IP站点链接的开销相加,计算出开销最低的路由路径。
- This class uses a linear search algorithm to find entries in the list of delegates. 该类使用线性搜索算法在委托列表中查找项。
- During routing resolution, when the connector selection is made, the least cost routing path to the destination address space is selected. 在解析路由的过程中,如果选择了连接器,将选择到达目标地址空间开销最低的路由路径。
- A linear search algorithm is inefficient when working with a large number of entries. 线性搜索算法在处理大量项时是低效的。
- If more than one remote Active Directory site has the same value for the least cost routing path, the first server on the list is selected. 如果多个远程Active Directory站点的最低开销路由路径值相同,则选择列表中的第一个服务器。
