查询词典 optimal path

First, the distance matrix of public transportation line is introduced, then the directed relation graph is constructed. In the directed relation graph, we can give the optimal line by revised shortest path algorithms.

首先通过引入各条公交线路直达最短距离矩阵构造了公交网络直达关系图，在直达关系图上，利用修改了的最短路算法，即可求得最优换乘路线。

It calculates the distance between two vectors to seek the optimal matching path uninterruptedly.

它是把时间规整和距离测度计算结合起来的一种非线性规整技术。

On the optimal economic growth path without the growth of productivity, the growth rate of bubble, interests rate (the marginal productivity rate of capital) and growth rate of population is consentaneous.

当生产率零增长、经济系统处于最优路径上时，泡沫增长率、利率与人口的增长率是一致的。

In this paper, a Multiple Ant Colony based Routing Algorithm is proposed for routing optimization designing, in which the communication messages sent by nodes for searching the optimal route are treated as ants with limited life-span. Through the ants' movement and Populations' cooperation, the main routing path and multiple candidate routing paths can be distributedly obtained.

提出了一种基于多蚁群无线传感器网络路由算法，采用多种群并行搜索，并在种群中采用基于目标函数值得启发式信息素分配策略和根据目标函数自动调整蚂蚁搜索路径，利用蚁群的分布式特点，通过有限寿命蚂蚁的协作在源节点与目的节点之间的运动获取主路径和备选路径，然后根据节点信息适时更新路由表。

Hypercube has many advantages, such as smaller diameter, simple routing algorithm, many parallel paths between any two nodes, and fault-tolerance, on the other hand that the Hypercube nodal degree increased logarithmetically to the number of nodes has limited network population. So we propose a constant nodal degree hierarchical topology to remedy the weakness of Hypercube and take advantages of Hypercube most. Given the definition of FCCN we analyse the basic properties including nodal degree , number of links , extensibility and diameter (maximum network communication delay). Also we proposed a simple and self-routing algorithm applied in FCCN. Although the self-routing algorithm is not optimal, but at more than 82% case it can get the shortest path, and the percent is larger and larger increased with network levels. By the self-routing algorithm the internodal distance is calculated to evaluate the network communication delay more clearly. The average internal distance is in order of the cubic root of the network population that is almost same as logarithmetically relation in a few thousands. FCCN is a highly scalable network due to its recursive construction.

首先在比较了基本互连网络的基础上，看到超立体网络的杰出性能，包括网络直径小、寻路算法简单且为自寻路算法、容错能力好等等，但是由于其节点度随网络的规模的增加而按对数关系增长，使得超立体网络的应用规模受到极大限制，所以为了能最大限度利用超立体网络的优点的同时弥补其节点度方面的不足，作者提出了节点度等于常数4的FCCN网络结构，来最多地利用立方体网络的优点；然后在对FCCN网络进行严格的定义后，分析了网络的节点度、链路数、延伸特性、网络的直径（决定网络的最大通讯延迟）等，并提出了适于FCCN网络的简单的自寻路算法，计算自寻路算法可得到最短路径的比例，看到在多于82％以上的情况自寻路算法都是最优的，而且比例随网络层数的增加而增加；应用所提出的自寻路算法计算了可以更加准确反映网络通讯延迟的参数—网络平均节点距离，计算得到此参数与网络大小的立方根成正比，此比例关系在网络的规模在几千节点以内与对数关系的网络几乎一样；FCCN网络是一高度可扩展结构，这是因为FCCN的递归构成方式，使得网络在增加节点时其原有的拓扑结构可以保持不变，不需对网络进行重新设计，为网络的实用扩展提供了条件；理论分析得出FCCN网络是一种高度可扩展高性能网络的结论。

On the basis of the ant routing principle, combining the driver′s preference, this paper put forward an optimal path selection algorithm which can reflect the driver′s partialness.

在蚂蚁寻径原理的基础上，结合驾驶员的偏好性，提出了一种能够综合反映驾驶员偏好的最优路径选择算法。

Ant routing principle; Driver′s partialness; Optimal path selection; Superior service factors; Inferior service factors

蚂蚁寻径原理；驾驶员偏好；路径选择；优性服务因素；劣性服务因素

Researching on the decision-maker's behavior hypothesis and classification principle in incomplete informational risk assessment, this paper built the rational decision-making route as①releasing the sequential or partible hypothesis of individual preference and alternatives independence condition in order to satisfy the actual decision-making;②keeping the optimal result of group decision-making according as the thought of"Binary comparison"of sequence path independence condition SPI building the hierarchy structure in opening frame of discernment to increase granularity of discernment.

研究不完全信息操作风险评价的决策者行为假设和分类方法，构建理性决策路径和决策机制：①放松Arrow选择理论的决策者个人偏好连续或可分假设、无关方案独立性条件，以满足决策过程的实际情况。②构建开放的决策识别框架，依据序贯路径无关条件的&两两比较&思想，保证群体决策结果的最优性；在开放的识别框架中建立层次结构，增加识别粒度。将主观信息表达转化为专家对某一属性判断的基本可信度分配，运用证据理论处理不完全信息的融合问题。③基于包含度的分层约简方法降低决策复杂度。

In this case, we use Most Rapid Approach Path to find relevant optimal advertising expending rule.

在这种情况下，利用最速收敛法求解出了相应的最优广告支出规律。

In order to get out from the cockamamie work in road route design for designers, on the basis of studying the internal relations among local schemes, local scheme was decomposed to small unit logic schemes; the directed network was used to represent the topological connection; the united data structure of point-arc was used to express a network graph. Based on the shortest path theory, the combinatorial optimization algorithm that can search optimal logical schemes of some targets in the network graph intelligently and can form the whole scheme automatically was put forward.

为了使设计者从道路线路设计的繁重计算统计工作中解脱出来，在研究了局部方案间内在关联的基础上，提出了将局部方案分解为更小单位的逻辑方案，用有向网络图表示逻辑方案间的拓扑关系，采用节点－弧段联合数据结构来表示网络图；同时基于最短路径理论，提出了在网络图中智能化搜索综合指标最优的逻辑方案集，自动形成整体方案的组合优化算法。

Effective local search tactics reaches local searchers when they are ready to buy - with every way that it is possible for them to buy from you.

有效的地方搜索策略达到当地的搜索，当他们准备购买-以各种方式，这是他们有可能从您那里进行购买。

The first two are periodic sentences for their beginnings; and the fifth and the last are also periodic sentences each for the embedding of a parenthetic structure.

1960年代中后期，当战后女权主义和当时的许多其他抗议运动在西欧和北美发展成某种势力时，性别的概念演绎成补充和延伸生物性别差异的概念。