๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal 1-edge fault-tolerant designs for ladders

โœ Scribed by Yen-Chu Chuang; Lih-Hsing Hsu; Chung-Haw Chang

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
306 KB
Volume
84
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Faithful 1-edge fault tolerant graphs
Faithful 1-edge fault tolerant graphs
โœ Shih-Yih Wang; Lih-Hsing Hsu; Ting-Yi Sung ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 726 KB

A graph G\* is l-edge fault tolerant with respect to a graph G, denoted by I-EFT( G), if any graph obtained by removing an edge from G' contains G. A l-Em(G) graph is said to be optimal if it contains the minimum number of edges among all I-EFT( G) graphs. Let Gf be 1 -EJ!T( Gi) for i = 1,2. It can

Optimal replacement for fault-tolerant s
Optimal replacement for fault-tolerant systems
โœ Howard M. Taylor; Beatriz E. Rodriguez ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 531 KB

We consider the optimal replacement problem for a fault tolerant system comprised of N components. The components are distinguishable, and the state of the system is given by knowing exactly which components are operational and which have failed. The individual component failure rates depend on the