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

The Complexity of the Residual Node Connectedness Reliability Problem

โœ Scribed by Sutner, K.; Satyanarayana, A.; Suffel, C.


Book ID
118177279
Publisher
Society for Industrial and Applied Mathematics
Year
1991
Tongue
English
Weight
760 KB
Volume
20
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The computational complexity of the reli
โœ Min-Sheng Lin; Deng-Jyi Chen ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 450 KB

The reliability of a distributed program in a distributed computing system is the probability that a program which runs on multiple processing elements and needs to communicate with other processing elements for remote data files will be executed successfully. This reliability varies according to (

The problem of reliability
โœ G.W.A.D. ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 25 KB