The minimal path is illustrated for each matrix.
两个矩阵的最短路径如图所示。
Listing 1 echoes a message as the script begins and sets a minimal PATH variable.
清单1回应一条消息作为脚本的开始，并且设置最小限度的PATH变量。
Constructing disjoint minimal path set is an important approach for reliability analysis of network.
网络系统不交化最小路集的求解是进行网络系统可靠性分析的重要途径。
This problem deals with finding a minimal path through a grid of points while traveling only from left to right.
该问题是要在一组点的格网中找到一条从左至右的最小路径。
This paper gives a new method of finding the minimal sub-tree and gives the method of finding the matrix of minimal path weight.
本文给出了求最小部分树的一种新方法，同时给出最短路权的矩阵求法。
The basic formulas and indices of reliability evaluation are established first, then a fast evaluation method based on minimal path is applied.
评估时首先建立可靠性评估的指标及其计算公式，然后使用一种基于最小路的配电网可靠性快速评估法。
After establishing calculating pane diagrams we can get the reliability results of all the main electric connections by minimal path set method.
建立工程计算方框图后，采用最小路集法，得出各种主接线方式的可靠性计算结果。
On the principle of path-algebra and introducing in lengthening matrix, passing array, open-closed flag and non-circuit minimal path matrix, etc.
应用路径代数原理，通过引入途经数组等，给出一种TSP的新解法。
On the base of assessment system data, we can calculate and analyze the reliability of all the main electric connection schemes by minimal path set method.
在评价系统数据建立的基础上，利用可靠性计算中的最小路法对各种主接线方式的可靠性进行计算和分析。
In this paper, we discuss the problem about description and calculation of reliability based on minimal path and minimal cutset for the class of complex system.
本文讨论基于最小路径和最小割集的复杂系统可靠性的描述与计算问题。
It finds out the minimal path for each load, considers the different contributions of the elements on the path and out of the path to the reliability of the load point.
该算法先求各负荷点的最小路，再分别考虑最小路上的元件和非最小路上的元件对负荷点可靠性的贡献。
With the new method, a minimal path feeder vector can be constructed to produce reliability indexes of a complex distribution system with sub feeders and alternative suppliers.
该方法以构造负荷点供电“最小路馈线段行向量”的方法，方便地求得带子馈线、备用电源的复杂配电网络的可靠性指标。
The minimal path sets (MPS) are achieved by Boolean algebraic simplification calculation. The authors put forward the analyzing result of the structural significance of the basic event.
采用布尔代数化简法求出系统的最小径集，给出了事故树中基本事件的结构重要度分析结果。
In this paper, on the basis of Gradient Vector flow (GVF) snakes, a fully automatic image segmentation algorithm based on the analysis of flow field and the minimal path method is proposed.
人工干预使蛇模型只能用于半自动的图像分割，该文在梯度向量流(GVF)蛇模型的基础上提出一种基于流场节点与最小路径方法的全自动图像分割算法。
Minimal path matrix are defined. Based on the special vector operations defined in this paper, reliability of the systems can be expressed exactly by those of subsystems, and the algorithm is given.
定义了最小路径矩阵的几种运算，利用所定义的运算，将多源点多汇点网络系统转化为等价的单源点单汇点网络系统，并给出了由子系统可靠度精确表示网络系统可靠度的解析表达式。
The critical points on the minimal energy path, which often denote stable states or transition states, are concerned.
最小能量路径上的临界点往往表示稳定状态或者转化状态，是人们所关心的。
By choosing an appropriate monitor function, the density of mesh points near the critical points can be bigger than that near other points on the minimal energy path.
通过在自适应零温度弦方法中选择合适的控制函数，可以使得最小能量路径上的网格点密度在这些临界点附近比较大。
Finally, Chapter eleven covers the special topics of the maximal flow problem, the shortest path problem, and the multicommodity minimal cost flow problem.
最后，第十一章覆盖了特殊主题：最大化流问题、最短路径问题和多物最小消费流问题。
An effective evaluation function is constructed, which use the signal line on the propagation path among the fault point and primary outputs. That makes the algorithm has the minimal search space.
该算法基于遗传算法，使用故障信号传播路径上的信号线来构造算法的评价函数，使得算法具有最小的搜索空间。
A matrix algorithm of minimal energy-consuming path and a matrix algorithm of maximal node-energy path for multiple points to one point communication in WSN are given.
给出了在WSN中多点对一点通信的最小能耗路径和节点能量最大路径的矩阵算法。
A matrix algorithm of minimal energy-consuming path and a matrix algorithm of maximal node-energy path for multiple points to one point communication in WSN are given.
给出了在WSN中多点对一点通信的最小能耗路径和节点能量最大路径的矩阵算法。
应用推荐