Evaluating performability: Most probable states and bounds |
| |
| Authors: | Charles J. Colbourn Daryl D. Harms |
| |
| Affiliation: | (1) Combinatorics and Optimization, University of Waterloo, N2L 3G1 Waterloo, Ontario, Canada;(2) Computer Science, Simon Fraser University, V5A 1S6 Burnaby, B.C., Canada |
| |
| Abstract: | The number of states examined by most probable state algorithms for performability computations can be reduced dramatically by incorporating simple connectivity-based bounds, even when the performability measure is much more complex than connectivity. Modifications to Yang and Kubat's most probable state method are presented that permit the use of simple auxiliary bounds with only a small effect on the time per iteration. Computational results for a variety of performability measures are given. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
