Abstract
Two new techniques for producing absolute lower and upper bounds on the reliability of a network are introduced. Both methods operate by combining information from known bounds to obtain improved bounds. The first uses linear programming, while the second uses bounds for networks with statistical dependence of failures.
| Original language | English (US) |
|---|---|
| Title of host publication | Conference Digest - International Electrical, Electronics Conference and Exposition |
| Place of Publication | New York, NY, USA |
| Publisher | IEEE |
| Pages | 124-126 |
| Number of pages | 3 |
| State | Published - 1985 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Engineering