研究的重点是路径选择组件的路径选择算法。
The key point is path selection algorithm of the path selection unit.
提出了一种基于网络总时延最小的路由路径选择算法。
A routing path selected algorithm based on the minimization of total delay is proposed.
通过模拟路网的验证显示，该最优路径选择算法是可行的。
It is indicated by simulation that the algorithm is resultful.
公交乘客出行路径选择算法是公交乘客信息系统的核心技术。
Optimal path algorithm of public transport networks is a key technique in public transport passenger information system.
实验结果表明，该算法的运算速度远远快于现有的路径选择算法。
Experimental results indicate that the proposed algorithm is much faster than any existing routing algorithms.
提出了一种基于平均分组时延与分组能量消耗乘积最小的路由路径选择算法。
A routing path selected algorithm based on the minimization product of packet delay and packet energy consumption is proposed.
针对现有无线传感器网络中路由协议产生“热点区域”问题，提出了一种能量平衡的路径选择算法。
An energy balance path selecting algorithm was proposed in order to avoid local "hotspots" which may be formed by many existing routing protocols used in wireless sensor networks.
提供了一种有大量的客户数据，只需对部分客户进行带有时间窗要求的货物配送的优化路径选择算法。
A kind of algorithm is provided to choose the optimized route for freight delivery that involves a great deal of clients' data, but, only deals with a part of them with the request of time Windows.
包括启发式路径搜索算法、基于原始-对偶算法的最优路径选择算法、信道分配调整算法等三个部分。
This algorithm consists of heuristic-based search algorithm, primal-dual-based optimal path selection algorithm and channel assignment adjustment algorithm.
此平台采用分布式消息路径选择算法生成消息交换路径树，便于XML消息引擎生成一个队列和路由策略。
The M-Commerce platform USES a message path finding algorithm to create a message queue in XML message engine for routing.
SDDPCM支持路径选择算法选项的动态选择，而AIXPCM需要为新路径选择算法重新配置每个hdisk才能生效。
SDDPCM allows for dynamic selection of path selection algorithm options, while the AIXPCM requires each hdisk be reconfigured for a new path selection algorithm to take affect.
根据在为I/O操作选择下一个路径时服务器适配器当前杰出 I/O操作的数量，这些算法会考虑到加载统计数据。
These algorithms take into account load statistics based on the number of currently outstanding I/O operations of the server adapters in selecting the next path for an I/O operation.
并在优化刀具选择和走刀路径等方面给出了加工过程的优化算法。
The optimized algorithm of machining process about moving route and reamer choice was introduced.
路径选择是交通配流的主要问题，本文采用遗传算法设计了一个新模型以求解交通配流问题。
The routing assignment is the main part of the city traffic capacity assignment problem. This paper presents a new model for the problem based on Genetic Algorithms.
论述蚁群算法在动态路径选择问题上应用。
The problem of dynamic route selecting by using ant colony algorithm was discussed.
该算法根据测量邻近点之间的曲率变化关系，优化选择测量点，生成测量路径和DMIS程序。
This algorithm can select appropriate measuring points to create the measuring path and DMIS program according to the curvature relationship between vicinity points.
算法采用探测包并行地搜索可行路径，并使用启发式函数随机选择下一跳节点。
This algorithm employs probes to search feasible paths in parallel, and USES heuristic functions to randomly select a suitable next node.
为了给路径选择模型提供合理的路径集输入，使路径集能够包含更多驾驶员实际选择的路径，提出了一种基于路段惩罚法的路径集生成算法。
To input a reasonable route choice set containing more routes of drivers' real choices into the route choice model, a route choice set generation algorithm based on link penalty method was proposed.
路由选择采用K条最短路径算法进行，备选路由集中首选最佳路由时考虑链路的代价、跳数和每一个链路上不可用波长数。
We adopt K shortest paths into routing and choose the best route in them considering link costs, links hops and the number of noutilized wavelength in a link.
本文采用最短路径算法解决产品的最优拆卸路径的选择问题，产品拆卸众多提供源时的拆卸路径问题。
There is a shortest path algorithm to select optimal disassembly path of product and find disassembly path of product with multi-supply-source.
为了选择最优路径，综合考虑出行时间、出行费用和换乘次数等因素，给出一个综合评价指数模型，并用算例对算法和模型的可行性进行验证。
In order to select optimum route, thinking about the factors which are time of transfers, cost of running and times of transfers, a compound evaluation index model is obtained.
文中分析了不同凸障碍环境下滚动路径规划子目标选择策略，并且还探讨了规划算法的可达性。
The subgoal determination strategy of rolling path planning is analyzed according to various convex obstacle environment. And the accessibility of the planning algorithm is also discussed.
运用该阻抗函数建立基于路径的动态用户最优路径选择变分不等式模型，给出了该模型的启发式算法。
A route-based variational inequality model and a heuristic algorithm of the dynamic user optimal route choice problem were proposed by the link travel time function.
该算法通过有效的选择和分配带宽资源的方式来选择路径，所以能解决链路传输业务的负载均衡问题。
Through the way of selecting and assigning the bandwidth resource, the algorithm could seek a proper path. So it can solve the problem of load balance of transmitting operations on the physical link.
该文研究了多限制路径选择问题，提出了一种基于有限选择洪泛的源路由预计算的服务质量路由算法。
This paper discusses the NP-complete multi-constrained path problem, and a precomputation source routing algorithm based on limited selective flooding is presented.
这种算法的关键是选择相干图来标识相位数据的可靠性，相位展开的路径由相干图导向。
The key of the algorithm is to point out the dependability of data by choosing coherence maps.
新算法考虑了公交换乘次数、换乘点选择以及出行总成本对求解最优路径的综合影响。
Transfer times, transfer point choice and the travel cost are taken into consideration in the new algorithm.
对进路选择建立了模型，在路径最短以及作业晚点最少的约束条件下采用遗传算法进行求解。
The route layout model was constructed, and it was worked out by GA which was appropriately used to solve the station route choice problem.
基于图论和DIKB算法，实现了一种最优路径的选择。
According to the map theory and DIKB, it is available to choose the best way.
在该算法中采用多路径分割，多个识别候选与地址字典相匹配，从众多的识别候选词中选择权值最大的候选作为识别结果。
By multi-segmentation path, multi-recognition results and address lexicon, the highest weight path is choosed for the last recognition results.
应用推荐