论文中提出了一种基于常规最短路径方法的分词算法：层进式最短路径分词方法。
This article introduce a way called layer shortest path way based on conventional shortest path way.
首先提出最短路径方法及应用，主要分两方面进行展开：点到点最短一条路径和点到点最短多条路径。
First, I begin with the problem the shortest path problem which is one classic problem in the routing part.
实现此目标的最佳方法是，找到给定站点与稳定的可理解的站点之间的最短路径。
The best way to do that is to find the shortest path between the site you are given and one that is stable and understandable.
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题。
Ant Colony optimization (ACO) is a new-style simulating evolution algorithm. The behavior of real ant colonies foraging for food is simulated and used for solving optimization problems.
当前实用性较强的射线追踪方法，包括波前法，最短路径法，走时插值法，程函方程有限差分法等。
More practical ray tracing methods currently include the wavefront method, the shortest path method, the travel time epenthesis method, the eikonal equation finite difference method, etc.
综述了用网络最短路径算法求解地震射线追踪问题的原理、方法技术以及存在问题和改进措施。
The principle and method of seismic raytracing with shortest path algorithm in networks are discussed, the relevant drawbacks in which and improved measures are also analyzed.
该方法对印刷质量较差的粘连字符效果更好，可以作为常用的最短路径法的一个很好的补充算法，以提高分割成功率。
This proposed segmentation method behaves particularly good for poorly printed characters, and it can make a good supplement of the most often used shortest path method.
并证明，该方法构造的神经网络只有一个稳定点，且从任意初始点均可收敛到该稳定点，该稳定点恰好对应图的所有最短路径。
The network can converge to this equivalence-point from arbitrary initial point and this equivalence-point corresponds exactly all the shortest path pairs of the graph.
该文基于最优化方法中的复形法，对多智能体领域里的机器人足球避障问题，给出了最短路径的解决方法。
This paper gives the method of the shortest path for obstacle avoidance of robot soccer in the multigent system based on the method of complex of optimization.
本文正是基于交通信息的路网的动态最短路径的拟物方法研究。
This paper is a study of quasi-physical method in the dynamic and shortest routing of road network based on traffic information.
为此，提出了线路相关集的概念和基于最短路径算法的线路相关集搜索方法，给出了线路相关因子的求解办法。
In this paper, a new concept RCTL (relative cluster of the transmission line) and the corresponding searching algorithm are proposed, and the method to calculate relative factor of RCTL is introduced.
对实现城市道路最短路径的道路数据的组织、相关技术和方法作了初步的研究，并构建了试验环境。
Preliminary research is made on the organization of the road data of the shortest path of urban roads, the relevant technique and methods, and an experimental environment is built.
建立了城市公共交通网络的阻抗函数，给出了公共交通网络最短路径的求解方法。
Finally, we establish a cost formula about public traffic system, and bring forward a solution of shortest path of public traffic network.
网状结构图是以“最短路径”为主，结合车辆通过率来确定多路径通行费用的分配方法。
The allocating algorithm of the net structure chart is the method of confirming the charge of many roads combined the pass rate, focused on the "shortest road".
提出了一种基于边界路由器的远程路由计算和查找方法，以边界路由器为核心计算远程路由信息，查找时通过路径长度比较实现最短路径的选择。
A new method which computes remote routing based on the border routers, was presented and finds the appropriate route by comparing the length of routing.
正演使用最短路径法射线追踪，反演采用SIRT方法。
Shortest path ray tracing is used in the forward step and SIRT in the inversion step.
将最短路径的信息反馈到系统中作为搜索的指导信号，并改进节点选择方法，以提高应用蚁群算法搜索无人机三维航路的效率。
To improve the efficiency of path planning, the message of the shortest path was introduced in the system as a searching guidance signal, and a modified nodes selection method was also given.
通过个体编码方法，将GTSP转化为多段图最短路径问题，采用动态规划算法求解；
GTSP is changed into multi-segment map problem which is solved with dynamic programming algorithm by individual coding.
仿真实验结果表明，混合规划方法能在路网信息不完备条件下实现最短路径动态诱导，有效避开拥堵区域。
The simulated experimental results indicate that the mixed planning can search the shortest path dynamically in road network with incomplete information and evade from congestion efficiently.
采用Q学习方法进行磁钉路径的智能规划，实现最短路径寻找，同时解决了任务调度及避障等问题。
Q learning method is used in intelligence planning path with magnets to achieve the shortest path search, obstacle avoidance, task scheduling and so on.
该方法首先根据特定准则计算各连接的权值，然后根据一种改进的最短路径选择策略确定路径。
The method first calculates the link weights based on a given criterion. Then a modified Open-Shortest-Path-First (OSPF) algorithm is proposed to calculate the paths.
并且按照由里到外寻找最短路径的方法，以直线段为单位对图形进行了加工路径的优化。
The host computer software can be programmed in graphic style, and resolve the graphics by line segment based on the rule of shortest path seeking from inside to outside.
并且按照由里到外寻找最短路径的方法，以直线段为单位对图形进行了加工路径的优化。
The host computer software can be programmed in graphic style, and resolve the graphics by line segment based on the rule of shortest path seeking from inside to outside.
应用推荐