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 表示對稱算法的機密密鑰。