说明:双击或选中下面任意单词,将显示该词的音标、读音、翻译等;选中中文或多个词,将显示翻译。
您的位置:首页 -> 词典 -> 最短路
1)  shortest path
最短路
1.
Improvement of shortest path of arborescent network in the case of Hamming distance;
Hamming距离下树型网络的最短路改进问题
2.
Time-varying shortest path problem with curfews;
时变条件下有宵禁限制的最短路问题
3.
An Approach to Biobjective Shortest Path;
一种求解双目标最短路的方法
2)  the shortest path
最短路
1.
Optimal solution neighborhood for the shortest paths in network;
网络最短路问题的最优解邻域
2.
The Shortest Path Problem with Constraints of Nodes and Arcs Cost;
带点弧约束的最短路问题——复杂性和算法
3.
Using the network characteristics,the sensitivity analysis on the shortest path problems is made by the traverse method searching all adjacency nodes.
利用网络的特性,采用遍历搜索方法对最短路径问题做出一个敏感性分析,适合于解决在一些实际系统模型中利用网络图进行规划时,需要对一些环节进行调整,却又能不破坏原最优计划的问题。
3)  shortest path problem
最短路
1.
The application of the structure of Hopfield neural network in the shortest path problem;
Hopfield神经网络结构在最短路问题中的应用
2.
With the development of our society,the application field of shortest path problem is wider and wider.
最短路问题是在图的基础上衍生出来的,也是网络优化中的一个基本问题,许多选择优化问题都可以转化为最短路问题来求解。
3.
This paper deals with TSP by transform TSP to a special Shortest Path Problem.
本文将解决TSP问题转化为一种特殊的最短路问题。
4)  shortest route
最短路
1.
As for a grid of the "hand in hand" type, it is pointed out that the best location of tie line is along the shortest route between the tip sections of the two corresponding feeders.
指出对于"手拉手"环状网,在2条馈线的最下游子分区间的最短路建设联络线的方案最优。
2.
In our paper, the particular application of the decompositionalgorithm is discussed for the shortest route on the national railway network.
将全国铁路网按路局划分,采用分解算法求解最短路,能使计算量大约降至由全路网直接计算的10(-8)。
3.
The general problem of shortest route has for been finely solved and more satisfactory computational results than other conventional methods has beem obtained.
用此法可圆满解决一般形式的最短路问题,计算结果优于其他常用方法,具有实际应用价值。
5)  shortest-path
最短路
1.
Database,as a main approach of dealing with massive data,is widely used in various areas in the society while classical Dijkstra algorithm is quite useful in solving shortest-path problem.
数据库作为处理大量数据的主要手段,已经被广泛应用于生活的各个领域,经典的D ijkstra算法对求解最短路问题有很好的指导作用。
2.
Due to large space demand and long time consumption,the traditional Floyd algorithm is not suitable for solving the shortest-path problem among any pair of vertices of china educational network,which includes about 366 422 vertices and 540 755 edges.
针对传统的Floyd算法难以解决中国教育网的平均最短路径长度计算问题,在对网络进行度分析的基础上,设计了一种宽度优先搜索(BFS)并行算法,该算法可有效地避免对出度为0的节点进行搜索,采用VC编写基于MPI(MessagePassingInterface)的并行程序,通过20台电脑连网计算分析,该方法取得了令人满意的结果。
6)  shortest path
最短路径
1.
Briefly on the shortest path algorithm in the urban road network;
浅析城市道路网中的最短路径算法
2.
The Realization of Shortest Path Algorithm in Traffic System;
最短路径搜索算法在交通系统上的应用
3.
Study on the multi-modal shortest path in time-varying network;
时变网络下多式联运的最短路径问题研究
补充资料:单相短路电流
分子式:
CAS号:

性质:一相导体与保护导体发生短路时流经相-零回路的电流。单相短路电流是评价和设计保护接零系统设计的基本要素。保护接零系统的单相短路电流不应小于低压断路器瞬时动作或短延时动作过电流脱扣器的整定电流的1.5倍;不应小于低压熔断器熔体额定电流的4倍。

说明:补充资料仅用于学习参考,请勿用于其它任何用途。
参考词条