shortest route problem

shortest route problem的基本解释

-

最短路问题

与shortest route problem相关的网络例句 [注：此内容来源于网络，仅供参考]

Secondly, by establishing a discrete time Markov model with spatial reuse for a MANET, we analyze the performance of the network under the AODV routing protocol. The average route length and the probability to communicate within a limited hop distance are obtained. Several performance parameters of the route discovery and route maintain process are analytically studied, such as the probability generating function and the expectation of the flooding distabce. the probability that a route is discovered by a query packet with a "hop limit", the probability that a request packet finds a valid route, the average time needed to discover a valid route and the cost to successfully route a data packet to its destination. Furthermore, we present a concrete example based on the transmitter characteristic of directional antennas and obtain the corresponding results.

建立了移动自组网络空间可重用的离散时间马氏链模型，得到了AODV路由协议下网络任意两节点间的平均路由长度、在指定"跳限"要求下通信的概率；对随选型路由协议下路由发现和路由维护过程中若干网络性能参数进行了解析分析，如网络中任意两节点问的泛洪距离的概率母函数及其期望、限定泛洪步数时成功寻路的概率、发现一条有效路由的平均时间、成功路由的代价等；并基于定向天线的发射特征给出了一个具体实例，分析计算了相应的网络性能参数。

The results show that the effectiveness of Route A is better than Route B. After ARB of 7 passes, the microstructure of the specimen by Route A consists of thin elongated fibriform grains with an average size of 470 nm, but that by Route B does compressed grains with an average size of 680 nm. The improvement in tensile strength by Route A is greater than that by Route B. The strengthening mechanism of 1060 commercially pure aluminum by ARB is fine-grain strengthening.

结果显示：路径A的晶粒细化效果比路径B明显；ARB7道次后，采用路径A的试样的显微组织由拉长的细小纤维状晶粒组成，路径B的试样由扁平状晶粒组成；路径A和路径B的试样的平均晶粒尺寸分别为470nm和680nm；路径A的试样的抗拉强度提高程度大于路径B.1060工业纯铝在ARB过程中的强化机制主要是细晶强化。

The symbols, the path and its length of NSP are defined and the properties of NSP are studied. The dissimilitude for shortest path of general net and NSP is indicated, and a loop in the NSP shortest path is allowed. A shortest path algorithm based on NSP is proposed. An example of finding the shortest path is presented.

在定义罚转向网络模型的符号、路径及路径长度的基础上，对所建立的罚转向网络模型的性质进行了讨论，指出了该模型中的最短路径允许具有回路，提出了求解从任一节点到其他有向弧和节点的最短路径的一个算法。

与shortest route problem相关的网络解释 [注：此内容来源于网络，仅供参考]

shortest route problem：最短道路问题

shortest route 最短道路 | shortest route problem 最短道路问题 | side 边

shortest route problem：最短路径问题

short word 短字 | shortest route problem 最短路径问题 | shot noise 散粒噪声

shortest route problem：最短 径问题

shortest route 最短 径 | shortest route problem 最短 径问题 | shuffling 重排,重

shortest route problem：最短路线问题

"最短路线","shortest route" | "最短路线问题","shortest route problem" | "最短寻觅时间优先","shortest seek time first,SSTF"