Any mathematical algorithms must be supplemented by heuristics . 任何数学算法必须由直觉来补充。
Let us start with an immediate consequence of the algorithm . 我们先提出该运算法则的一个直接推论。
It is, of course, very easy to improve the efficiency of the greedy algorithm . 当然,贪婪算法的有效性是很容易改进的。
In many earlier studies simplicity of the algorithms used has been emphasized . 在许多早期的研究中往往重视算法的简单性。
This way, the advantages and disadvantages offered by the various algorithms will be more appreciated . 只有这样,才能更好地权衡各种运算方法的优缺点。
A computer algorithm is used to find the minimum travel time between all consumer nodes and all bank locations . 利用计算机程序找出所有消费者点和所有银行点间的最少往来时间。
With the exemption of simple techniques like thresholding, segmentation algorithms require the examination of each point in comparison to its neighbours . 与取阈值的简单方法不同,分割算法需要把每点与其近邻作一一比较。
The branch - and - bound algorithm for max - cut problem 求解最大割问题的分枝定界算法
A power control algorithm for cdma cellular system 蜂窝通信系统中的功率控制算法
Represents the secret key for the symmetric algorithm 表示对称算法的机密密钥。