## Abstract Consider a directed, sourceβsink network whose arcs either function or fail with known probabilities. This paper presents a decomposition algorithm for the exact computation of the reliability of such a network; that is, the probability that there exists a path from the network's source
β¦ LIBER β¦
Comparative analysis of network reliability algorithms
β Scribed by Srdjan Holovac
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 337 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0026-2714
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A decomposition algorithm for network re
β
A. W. Shogan
π
Article
π
1978
π
John Wiley and Sons
π
English
β 945 KB
Polynomial algorithms for estimating net
β
Eitan Zemel
π
Article
π
1982
π
John Wiley and Sons
π
English
β 751 KB
## Abstract We consider the problem of calculating the best possible bounds on the reliability of a system given limited information about the joint density function of its components. We show that a polynomial algorithm for this problem exists iff such an algorithm exists for a certain related pro
Bounding algorithms for two-terminal net
β
G. Thangamani
π
Article
π
1994
π
Elsevier Science
π
English
β 418 KB
A new formula and an algorithm for relia
β
Lian-Chang Zhao; Fan-Jia Kong
π
Article
π
1997
π
Elsevier Science
π
English
β 523 KB
Recursive analysis of network reliabilit
β
A. Kershenbaum; R. M. Van Slyke
π
Article
π
1973
π
John Wiley and Sons
π
English
β 530 KB
Network reliability analysis: Part I
β
R. Van Slyke; H. Frank
π
Article
π
1971
π
John Wiley and Sons
π
English
β 545 KB