However, geographic routing faces a local minimum problem when greedy forwarding strategy fails.
可是，基于地理位置信息的路由面临一个贪婪转发策略失败的本地最小问题。
The local minimum problem is a much important factor which restricts the performance of the classic LBG algorithm.
经典LBG算法的局部极小值问题是制约其性能的重要因素。
Depending on the strategy of choosing initial transformations many a time, the local minimum problem in process of iterative detection have been solved.
通过多次选择初始变换的搜索策略，解决了搜索过程中出现的局部极小值问题。
应用推荐