Due to chaotic ergodicity, TSP can always achieve optimal path.
由于混沌具有遍历性，TSP问题总是能够达到最优解。
Theoretical analysis and experimental results show that the algorithm can find the optimal path.
理论分析和试验结果证明该算法能较好的找到最优路径。
Finally, the author explored the problem of the optimal path of employment and the adjustment costs.
最后，探讨了最优就业路径和调整成本问题等等。
Identify correlations between activities and objectives to better predict the most optimal path to success.
确定活动和目标之间的相关性，以便更好地预测最成功的最佳路径。
The paper proposed an optimal path-planning algorithm for dynamic environment with multiple robots (obstacles).
提出一种在未知动态环境中进行启发式优化搜索的实时路径规划算法。
Path planning is searching a optimal path without touch form the start to the end under way a performance indicators.
路径规划是按照某一性能指标搜索一条从起始状态到目标状态的最优或近似最优的无碰路径。
Optimal path algorithm of public transport networks is a key technique in public transport passenger information system.
公交乘客出行路径选择算法是公交乘客信息系统的核心技术。
If we neglect some secondary factors, the searching time and space will only be the linear functions of the optimal path.
如果忽略一些次要的因素，搜索的时间和空间仅是最佳路径的线性函数。
So the most optimal path planning is regard as the problem of searching for roads which have the least cost in a road net.
所以，最优路径规划最终都可以归结为在特定的道路网络中搜索总代价最小的目标路径问题。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the …
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
Path analysis is the most important to Traffic network analysis, while optimal path algorithm is the core of path analysis.
交通网络分析的重点是路径分析，而路径分析的核心为最优路径算法。
This paper proposed an optimal path planning method for a sailboat sailing around race marks based on section optimization.
本论文提出了基于分区段优化思想的帆船比赛绕标航行最优行驶路径规划方法。
In order to resolve the question, the thesis put forward the optimal path algorithm in distributed multi-level road network.
针对这一问题，本文提出了大区域分布式多级道路网的最优路径算法。
With constrain of resource scarcity, scientist trends to choose his optimal path rationally to obtain comprehensive interest.
在资源稀缺的约束下科学家倾向于理性地选择实现综合利益的最优路径。
The continually optimized connecting relation is gained via perceptron and XOR function, then the optimal path graph is found.
利用感知器异或函数获得了节点之间不断优化的连接关系，然后得到最优路径图。
ITS involves many aspects of traffic field. And in these aspects, one important application is the choosing of the optimal path.
智能交通涉及到交通领域的多个方面，最优路径的选择就是其中的一个重要应用。
Through an automatic termination condition, the redundant learning after finding optimal path is avoided and the time of learning is reduced.
通过加入算法的自主学习结束条件，避免了找到最优路径后的重复学习，节省了学习时间。
According to the network information, vehicles select dynamically the OD path to maintain the optimal path and optimize the urban traffic condition.
车辆根据路网信息，动态地选择起讫点的最短路，以保持较佳的行驶线路，进而优化城市交通。
The algorithm reduced the unnecessary search space by using anchors and path reuse, and reduced load on server. Finally it discovered a near optimal path.
通过定位点的使用和路径复用，使得无用空间的探索大幅减少，降低了服务器的负载，最终探索出一条接近最优的路径。
This algorithm consists of heuristic-based search algorithm, primal-dual-based optimal path selection algorithm and channel assignment adjustment algorithm.
包括启发式路径搜索算法、基于原始-对偶算法的最优路径选择算法、信道分配调整算法等三个部分。
Simulation results show that it generates global optimal path in most situations, and is very time and space efficient thus suitable for real time applications.
仿真表明，本文算法通常都能得到全局最优路径，并且规划速度快、内存需求小，非常适合于实时应用。
But it is difficulty to expand the existing hierarchical network models and algorithms for finding optimal path problems in the stochastic and time-dependent network.
但是现有的层次网络模型和最优路径算法难以扩展到时变、随机网路中，为此本文提出了网络树模型和最优路径算法。
In the method that reflects autocorrelation of image, the optimal path of scanning image is acquired by inherent coherence and relationship among near pixels of image.
该方法是根据图像相邻像素灰度值之间的内在关系求出扫描图像像素的最佳路径。
Some experiments have been made to examine the principles of optimal path, shortest tree and maximum flow as well as the application of algorithm in the network of road.
研究试验了最优路径、最短树、最大流等方面的原理与算法在道路图中的应用。
Finally, the disparity of both matched and occluded points are obtained through finding the optimal path using dynamic programming, and the dense disparity map is obtained.
最后通过动态规划寻找最优路径来获得匹配点和遮挡点的视差，从而得到稠密视差图。
Finally, the disparity of both matched and occluded points are obtained through finding the optimal path using dynamic programming, and the dense disparity map is obtained.
最后通过动态规划寻找最优路径来获得匹配点和遮挡点的视差，从而得到稠密视差图。
应用推荐