查询词典 shortest path problem

On the basis of Venigalla\'s work,we adopted two path-based algorithms, namely,gradient projection algorithm and disaggregated simplicial decomposition algorithm to solve nonadditive path cost traffic assignment problem under different engine operating modes.We compared the above two algorithms in a network example which showed that compared with the traditional Frank-Wolfe algorithm, the two path-based algorithms had a more quicker convergency while getting optimal solution,and it can obtain a satisfying solution in most cases.

2在Venigalla等人研究工作的基础上，分别采用基于路径的梯度投影算法(gradient projection，GP)和基于路径的非集计的单纯分解算法(disaggregated simplicial decomposition，DSD)来求解考虑不同发动机启动模式下，具有非可加路径费用的交通分配问题，在实例计算中比较了这两种算法的计算性能。

For the np-hard problem of constructing minimum connected dominating set in ad hoc networks, this paper proposed a novel distributed mcds constructing algorithm called dmca. dmca constructed a mcds for ad hoc networks based on a maximal independent set. in dmca, each node only required the knowledge of its one-hop neighbors and there existed only one shortest path connecting two dominators these were at most three hops away.

摘 要：针对无线自组织分组网络中最小连通支配集创建np难问题，提出了一种分布式的最小连通集创建算法dmca.dmca基于最大独立集的构建，只需要周围一跳邻居的信息，在不超过三跳距离的一对支配节点之间找出一条最短路径。

Finding the shortest path in a directed network is the basic problem in graph theory.

有向图中的最短路径问题是图论应用的基本问题，对很多实际问题很有指导意义。

The data in LLE are optimized using the small world algorithm, and the shortest path and the local neighbor set clustering coefficients are used as the local parameters. As a result, the problem of the embedding distortion using only local linear patch of the manifold to define neighborhood in Euclidean space is effectively solved. Three groups of standard data sets are selected to test and to compare the efficiency and robustness of SLLE and LLE.

将复杂网络算法引入到流形学习中，利用小世界算法对LLE算法进行数据优化，并以最短路径和局部集群系数作为局部优化参数，解决了数据点不规则时以欧氏空间作为邻域判别标准在构建局部超平面造成嵌入结果扭曲的难题。

In the residual moveout, I firstly describe the Viterbi algorithm based on Markov process and compound decision theory and how to solve the shortest path problem using Viterbi algorithm.

在剩余时差校正中，首先阐述了基于Markov过程和复合判定理论的Viterbi算子；阐述了如何利用Viterbi算子来处理最短路经问题。

Example, can be resolved, such as mathematics function approximate maximum shortest path problem. Vb development, very good.

有关遗传算法的例子，可以解决诸如数学中函数近似最大值，最短路径的问题。vb开发的，很好的。

For the purpose of solving the shortest path problem between any two nodes on urban traffic networks, We present a mixed connected graph representing the urban transportation networks, and choice set of main line is proposed in our disertation, according to urban road layout and rule of vehicle rout, we supposed a multi-phase labeling algothrim base on classical Dijskra labeling algorithm, a list of examples for all possible relation between two nodes are provided, all the examples is calculated by the proposed computer program, which indicates that this algorithm is feasible and effective.

为了研究城市路网上任意两顶点间的最短路问题，结合城市交通特点提出了最小干线选择集的概念，在著名的Dijkstra算法基础上，根据城市路网布局和配送车辆行车规则，给出一种多阶段定向搜索标号算法。

I-1 n 2 i for the problem of shortest path amidst a fixed number of convex polyhedral obstacles.

在包含一组相互分离凸多面体的三维空间中为任意两点寻找最短路的问题是个NP问题［2］。

The DAN algorithm could be applied to the problem of the shortest path only to analyze the recordation of the front DNA chain.

将算法推广到最短路问题的不同之处在第三步，即只需分析在表面上排在最前的DNA链的实验记录就得到最短路。

The shortest path problem is very important in the network optimization.

最短路径的算法研究是网络优化技术的核心。

Now she was hungry and angry.She began to smoulder.

现在她又饿又气，她开始流露难以抑制的怒火。

You have placed our iniquities before You, Our secret sins in the light of Your presence.

诗90：8 你将我们的罪孽摆在你面前、将我们的隐恶摆在你面光之中。