首页| JavaScript| HTML/CSS| Matlab| PHP| Python| Java| C/C++/VC++| C#| ASP| 其他|
购买积分 购买会员 激活码充值

您现在的位置是:虫虫源码 > 其他 > 每一个二进制的弧

每一个二进制的弧

资 源 简 介

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.

文 件 列 表

孙惠Improving efficiency of solving d-MC problem in stochastic-flow network.pdf
www.pudn.com.txt

相 关 资 源

您 可 能 感 兴 趣 的

同 类 别 推 荐

VIP VIP
0.342997s