Abstract An example is given to demonstrate that all-terminal reliability polynomials of networks... more Abstract An example is given to demonstrate that all-terminal reliability polynomials of networks having the same number of nodes and the same number of links can cross twice as the edge operation probability ranges from 0 to 1 . A similar result is shown for two-terminal reliability.
This book contains information obtained from authentic and highly regarded sources. Reprinted mat... more This book contains information obtained from authentic and highly regarded sources. Reprinted material is quoted with permission, and sources are indicated. A wide variety of references are listed. Reasonable efforts have been made to publish reliable data and ...
... Charles J. Colbourn Computer Communications Networks Group, Department of Computer Science, U... more ... Charles J. Colbourn Computer Communications Networks Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G7 Canada Daryl D. Harms Department of Computational Science ... In this class, Jacobs (131 developed some easy bounds. ...
Efficient methods for determining the lower and upper bounds on the probabilities of source-to-te... more Efficient methods for determining the lower and upper bounds on the probabilities of source-to-terminal communication in a multistage interconnection network are developed. A novel lower bounding strategy (shifting) and a novel upper bounding strategy (renormalization) are presented; both can be computed in polynomial time. These strategies can be combined with existing methods based on coherence, and on consecutive cuts, to obtain an improvement on previously known efficiently computable bounds. A second efficient upper bound (averaging) is developed. An empirical evaluation of the bounds is discussed. Finally, the value of these bounding strategies in assessing the reliability of interconnection networks is examined.
... For the following discussion, given an undirected graph G(V,E), let c be the minimum number o... more ... For the following discussion, given an undirected graph G(V,E), let c be the minimum number of edges whose removal disconnects s and t, and let 1 be the length of a shortest path from s to t in ... We implemented a factoring algorithm for obtaining the exact two-terminal ...
The number of states examined by most probable state algorithms for performability computations c... more 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
Abstract An example is given to demonstrate that all-terminal reliability polynomials of networks... more Abstract An example is given to demonstrate that all-terminal reliability polynomials of networks having the same number of nodes and the same number of links can cross twice as the edge operation probability ranges from 0 to 1 . A similar result is shown for two-terminal reliability.
This book contains information obtained from authentic and highly regarded sources. Reprinted mat... more This book contains information obtained from authentic and highly regarded sources. Reprinted material is quoted with permission, and sources are indicated. A wide variety of references are listed. Reasonable efforts have been made to publish reliable data and ...
... Charles J. Colbourn Computer Communications Networks Group, Department of Computer Science, U... more ... Charles J. Colbourn Computer Communications Networks Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G7 Canada Daryl D. Harms Department of Computational Science ... In this class, Jacobs (131 developed some easy bounds. ...
Efficient methods for determining the lower and upper bounds on the probabilities of source-to-te... more Efficient methods for determining the lower and upper bounds on the probabilities of source-to-terminal communication in a multistage interconnection network are developed. A novel lower bounding strategy (shifting) and a novel upper bounding strategy (renormalization) are presented; both can be computed in polynomial time. These strategies can be combined with existing methods based on coherence, and on consecutive cuts, to obtain an improvement on previously known efficiently computable bounds. A second efficient upper bound (averaging) is developed. An empirical evaluation of the bounds is discussed. Finally, the value of these bounding strategies in assessing the reliability of interconnection networks is examined.
... For the following discussion, given an undirected graph G(V,E), let c be the minimum number o... more ... For the following discussion, given an undirected graph G(V,E), let c be the minimum number of edges whose removal disconnects s and t, and let 1 be the length of a shortest path from s to t in ... We implemented a factoring algorithm for obtaining the exact two-terminal ...
The number of states examined by most probable state algorithms for performability computations c... more 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
Uploads
Papers by Daryl Harms