This is the STL's find algorithm.
这个就是STL的find算法。
Don't diddle code to make it faster—find a better algorithm.
不要为了使代码更快而胡乱编写代码——要找到更好的算法。
And finally, IBM helped set up an it infrastructure to gather the data, apply the algorithm, and tell workers exactly what to load on the trucks and where to find it.
最后，IBM帮助他们建立起一套IT的基础设施用于收集数据，应用算法，准确的告诉工人卡车中装载什么，哪辆车用于装载货物。
So, it's easy to find examples where the simple algorithm produces a better answer, and some where the complex algorithm does.
因此，很容易找到简单算法产生更好答案的示例，而复杂算法产生更好的答案的另一些示例。
No more searching into your old books for the best algorithm to find out whether one node is positioned before the old one in the tree.
不需要在旧书里面查找最佳的算法以确定一个节点是否在树中另一个节点的前面。
If you find the length of the garbage collection runs are too long, you can tune your JVM to use a different garbage collection algorithm (the details depend on the version and vendor of your JVM).
如果发现垃圾收集的运行时间太长，可以考虑让JVM使用另一种垃圾收集算法(具体细节取决于JVM的版本和厂商)。
It's even more common to find crucial flaws in crypto-graphic algorithm implementations, which can turn strong encryption into weak encryption (or sometimes no encryption at all).
而更为普遍的情况是，加密算法实现被发现具有关键的缺陷，可以让原本的强加密退化成弱加密(有时甚至相当于完全不加密)。
Find isn't the only STL algorithm that has such a set of requirements; the arguments to for_each and count, and other algorithms, must satisfy the same requirements.
Find不是唯一的需要这一系列要求的STL算法：这些参数用在for each和count，和其他算法时，也必须具备这些条件。
Shor's algorithm, for example, is able to find the period of a function of N bits in polynomial time.
例如 Shor的算法能在多项式时间内找到一个N位函数的周期。
This makes tag generation simple but requires a search algorithm to find the correct revision or version.
这简化标签的生成，但需要查找算法来找出正确的修正或版本。
Algorithm to find a hierarchy tree in a directed acyclic graph?
算法来找到一个层次树在一个有向无环图吗？
Find the best combination in a assignement problem can be CPU expensive, and long to be executed. Depends on your algorithm and your set of data.
在一个分配的问题找到最佳的组合可以被CPU昂贵，长期被处决。取决于你的算法和数据集。
In this paper, comparison of the sequencing comparison, hoping to find a suitable algorithm.
本文主要对比各排序进行对比，希望能找出一种合适的算法。
Here we use the ant colony algorithm to solve the problem to find the shortest path to travel.
这里我们运用蚁群算法对问题进行求解找到最短的旅行路径。
It has important theoretical significance and application value how to find an effective learning algorithm of RBF neural networks.
如何找到一种更加行之有效的RBF神经网络学习算法具有重要的理论意义和应用价值。
The experiments results reveal that the algorithm can find some interesting general earthquake sequences.
实验测试结果表明：该算法能够发现一些有意义的广义的地震序列。
Assuming I understand your question correctly, yes, there is a general algorithm to find a solution (i. e. a satisfying assignment) by using the algorithm for the satisfiability problem.
如果我理解正确，你的问题是，有一个解决的一般算法(即一个满意的分配)利用算法的可满足性问题。
The algorithm takes advantage of the bacterium's reaction to chemoattractants to find the optimum.
该算法利用细菌在引诱剂环境下的应激反应动作来进行函数优化。
So our key is to find out the suitable algorithm, carry on just appraisal.
所以我们关键是找出合适的算法，进行公正的评价。
As the name implies, the hash part USES a hash algorithm to store and find its keys.
顾名思义，散列部分用散列算法存储及查找它的键。
Finally an iteration algorithm to find an optimal stationary policy is proposed, and an numerical example is provided to (illustrate) the application of the algorithm.
最后给出一个求解最优平稳策略的迭代算法，并提供一个数值例子以表明该算法的应用。
By analysing of the visibility edges of the polygons, using the plane sweep technique, we present an algorithm to find the visibility edges of the set of polygons.
通过对多边形可见边的分析，利用平面扫描技术，给出了求其可见边的算法。
Based on those two methods, a new algorithm - Double Propagating Wave algorithm is presented to find a optimum global path.
在这两种方法的基础上，本文提出了基于双波传播算法的全局路径规划方法。
Their algorithm to find extensions is considered to be more efficient than the existing reconstruction procedure, and it is decidable .
我们提出的寻找外延的算法要比现有的重构过程更有效，且它是可判定的。
The idea of this algorithm is to find the optimal solution in the feasible region by an iterative step from one basic standard hyperplane to another.
此算法的基本思想是在规划问题的可行域中由所建的一个切割面到另一个切割面的不断推进来求取最优的。
The test showed that the algorithm can find the best result quickly and have good extended character.
实验表明算法能快速找到最优解，而且具有良好的扩充性。
Moreover, topology discovery tool implementing this algorithm can find the accurate heterogeneous network physical topology.
运用算法开发的工具能准确发现异构网络的拓扑。
Based on a mathematic model of the multi-vehicle distribution scheduling problem, the authors find a tabu search algorithm for it through designing a new solution expression method.
在建立多车型配送车辆调度问题的数学模型的基础上，通过设计一种新的解的表示方法建立了求解该问题的禁忌搜索算法。
We also define the simplified multielement least upper bounds and provide effective algorithm to find them last.
为此给出概念的最简多元最小上界的定义，并提供了寻找最简多元最小上界的有效算法。
We also define the simplified multielement least upper bounds and provide effective algorithm to find them last.
为此给出概念的最简多元最小上界的定义，并提供了寻找最简多元最小上界的有效算法。
应用推荐