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 表示对称算法的机密密钥。