文件名称:Improving
介绍说明－－下载内容均来自于网络，请自行研究使用
Each arc of a binary-state network has good/bad states. The system reliability, the probability
that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An
MP is an ordered sequence of arcs from s to t that has no cycle. Note that a minimal path is
different from the so-called minimum path. The latter is a path with minimum cost.
that source s communicates with sink t, can be computed in terms of minimal paths (MPs). An
MP is an ordered sequence of arcs from s to t that has no cycle. Note that a minimal path is
different from the so-called minimum path. The latter is a path with minimum cost.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
孙惠Improving efficiency of solving d-MC problem in stochastic-flow network.pdf