在组播树建立之初，计算好组播节点之间的最小代价路径，以便于出现故障之后寻找最优备用链路；
Using STP algorithm, the least cost paths between nodes are computed when computing the working tree, so the best backup path can be found as soon as the failure occurs.
针对具有时延约束最小代价路径问题，提出一种基于禁忌搜索方法的时延约束的最小代价单播路由算法（TSBDRA）。
A novel algorithm based on Tabu Search for Delay-Constrained Least-Cost Routing (TSBDRA) is proposed to solve delay-constrained least-cost unicast routing problem.
然后它会选取代价最小（对DB210 而言）或是代价稍大但风险较小的路径。
Then it will either pick the cheapest access path or (as of DB2 10) a slightly more costly but less risky path.
除非不可用，否则代价最小的路径总是被使用。
The lowest cost path is always used unless the other path is down.
所以，最优路径规划最终都可以归结为在特定的道路网络中搜索总代价最小的目标路径问题。
So the most optimal path planning is regard as the problem of searching for roads which have the least cost in a road net.
节点根据能量消耗的代价来选择至簇头的路由，通过扩散算法来广播代价消息，采用贪婪算法来选择能量消耗最小的路径；
The new protocol finds the path to the cluster head with the minimum cost, using an algorithm similar to flooding to propagate the cost information and greedy algorithm to find the lowest cost link;
第一种是社区最短路径模型，第二种是社区最小代价模型，第三种是引入概率的最小代价模型。
The first one is community model based on shortest path, the second one is based on least cost by introducing a turn penalty, the last one is community model based on probability and turn penalty.
第一种是社区最短路径模型，第二种是社区最小代价模型，第三种是引入概率的最小代价模型。
The first one is community model based on shortest path, the second one is based on least cost by introducing a turn penalty, the last one is community model based on probability and turn penalty.
应用推荐