查询词典 shortest path

Secondly, geodesic Gaussian basis functions are defined on the graph. A shortest path obtained by a shortest path faster algorithm is used to approximate a geodesic distance.

其次，在图上定义测地高斯基函数，并用基于最短路径快速算法得到的最短路径来逼近测地线距离。

Open Shortest Path First is a routing protocol developed for Internet Protocol networks by the Interior Gateway Protocol working group of the Internet Engineering Task Force. The working group was formed in 1988 to design an IGP based on the Shortest Path First algorithm for use in the Internet.

最短路径优先是Internet 任务工程组的一个工作组为IP网络开发的一个内部网关路由选择协议，该工作小组成立于1988年并致力于为INTERNET应用设计一个基于最短路径优先算法的内部网关路由协议。

How to provide route to meet the driver's multiple psychological expectations is the key problem of navigation system. The essence of this problem is resource constrained shortest path problem, which belongs to NP-C problems and can not be solved with the traditional shortest path algorithm.

提供满足驾驶员多个心理期望的路径是导航系统该解决的关键问题，其本质是资源约束最短路径问题，属于NP难问题，无法使用传统的最短路径算法解决。

According to disadvantage of AS that the speed low of convergentiss and easily entering the stagnation,improving the AS in some aspect by the way that importing pheromone windows that the value of pheromone cannot exceed the window,only deposit the pheromone on the edge that belongs to the iteration shortest solution path,releasing additional pheromone to the edge belongs to the so-far shortest solution path,judging the situation of convergent and to reinitialize pheromone,optimizing the solutions by local search procedure at the end of every iteration,modifying the transition probability by add some problem specific parameters and so on.

本文主要运用蚁群优化算法(Ant Colony Optimization，ACO)来求解VRP。针对蚁群算法收敛性比较差，易于停滞的缺陷，通过使用信息素窗口限制、信息素的最大最小值，只更新信息素迭代中最好解，增加了精英的蚂蚁，信息素重新初始化之前先判断出汇聚情况，在每次迭代过程中加入局部的搜索进行优化，在对蚁群算法进行了优化时考虑选择概率当中加入与问题的相关参数等措施，从而使蚁群算法的收敛性得到大大提高，避免了算法的停滞现象。

The shortest path approximation algorithm builds a weighted graph from the given set of scattered points using the distribution of these data points. By computing the shortest path in the weighted graph, the problem of curve reconstruction from scattered data points is transformed into that of curve reconstruction from a set of ordered data points.

最短路逼近算法首次将图论中最短路径理论引入到曲线重建中，根据散乱数据点的分布构造带权连通图，通过求解带权连通图的最短路径，将散乱数据点集的曲线重建问题转化为有序数据点集的曲线重建问题。

This article studies based on the shortest path city public transportation intelligence inquiry system, first aims at the city public transportation line network chart establishment mathematical model; Then research based on above mathematical model database creation method and corresponding algorithm design, with take Dijkstra algorithm as foundation, based on path shortest public transportation line inquiry algorithm, and through simple analog data confirmation algorithm validity; Finally brief introduction according to this thought design realization city public transportation intelligence inquiry system.

研究基于最短道路的城市公交智能查询系统，首先针对城市公交线路网络图建立数学模型；然后研究基于上述数学模型的数据库建立方法和相应的算法设计，和以Dijkstra算法为基础的、基于道路最短的公交线路查询算法，并通过简单模拟数据验证算法的有效性；最后简要介绍按此思想设计实现的城市公交智能查询系统。

The first is to choose any one of the impossible shortest path but it doesn't eliminate any of the impossible shortest path by passed top clusters to unpassed top cluster.The second is tha...

而Dijkstra原始算法仅在可能存在的多条最短路径中任选其中一条即可；2、Dijkstra算法的每一步骤，不仅要求路径最短，同时还要求经过的顶点最少，从而求出被原始算法忽略的所有可能存在的最短路径；结果最终可以求出带权图中一起始点到其余顶点的所有最段路径。

Consequently the NN adaptive unit is added into the control loop according to the NN on-line approximate property. Lastly the chapter combines the proposed shortest path-planning method and the adaptive tracking method in order to stabilize the NWMR about a posture through the shortest path. Many simulations are carried out on MATLAB and the simulation results are very feasible and reasonable. Chapter 5 proposes a new localization method for the WMR running on inclined planes based on fusion of clinometric and an odometric data by Kalman filter.

本文首先求得了在斜面上运行的NWMR动力学系统的状态方程；接着选择了适当形式的系统输出方程，采用非线性系统解耦方法对该系统实现了输入—输出线性化，并应用线性系统方法进行镇定；然后提出了基于人工神经网在线逼进NWMR动力学特性的自适应跟踪控制方法；最后将本文最短距离路径规划方法与跟踪控制方法相结合实现了NWMR系统状态镇定，并通过仿真实验证明了该方法的有效性。

B Mine the core of consortium based on the Six Degrees of Separation and describe Shortest Path based on LINk wEight algorithm SPLINE（Shortest Path based on LINk wEight）.

b 基于六度分割和最短路径社团核心成员挖掘，讨论了计算节点间的最短路径，根据六度分割定理的剪枝，基于SPLINE算法和中心度挖掘犯罪子团伙中的核心的技术。

This implies the existence of a polynomially bounded algorithm to find a shortest contractible cycle, a shortest separating cycle, and shortest cycle in an embedded graph in the projective plane and answers the open problems raised by Mohar and Thomassen in the case of projective plane embedded graph.

另一方面，通过定义嵌入图的几何对偶图及其相应的嵌入系统，得到几何对偶图中的可分离圈就对应于原图中的割；反之，若几何对偶图中的割在原图中对应于一个圈，那么该圈一定可分离。

Putt your way through 36 fun-filled holes of minigolf on 3D designed courses with elevated greens, bunkers, bridges and water hazards, among other crazy obstacles.

您的推杆方式，通过36个有趣的填孔迷你的三维设计的课程，以提升绿党，掩体，桥梁和水的危害，除其他疯狂的障碍。

Some participles can be used either as attributes or as predicatives.

有些分词既可当定语用，也可当表语用。