𝔖 Bobbio Scriptorium

✦ LIBER ✦

An O(n·(log2(n))2) algorithm for computing the reliability of k-out-of-n:G k-to-l-out-of-n:G systems: BELFORE , II. IEEE Transactions pn Reliability 44(1), 132 (March 1995)

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 224 KB
Volume: 36
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(96)84393-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(k3·log(nk)) algorithm for the conse

An O(k3·log(nk)) algorithm for the consecutive-k-out-of-n:F system: FRANK K. HWANG and PAUL E. WRIGHT. IEEE Transactions on Reliability, 44(1), 128 (March 1995)

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 116 KB

An O (k · n)-time algorithm for computin

An O (k · n)-time algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system: F. K. Hwang. IEEE Transactions on Reliability, 42(1), 161 (1993)

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 105 KB

An O (n · log(n)) algorithm to compute t

An O (n · log(n)) algorithm to compute the all-terminal reliability of (K5, K2,2,2) free networks: T. Politof, A. Satyanarayana and L. Tung. IEEE Transactions on Reliability, 41(4), 512 (1992)

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 106 KB

An O(kn) algorithm for a circular consec

An O(kn) algorithm for a circular consecutive-k-out-of-n:F system: Jer-Shyan Wu and Rong-Jaye Chen. IEEE Transactions on Reliability41(2), 303 (1992)

📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 115 KB