✦ LIBER ✦

An O(kn)-time algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system

✍ Scribed by Hwang, F.K.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(kn) algorithm for a circular consec

✍ Wu, J.-S.; Chen, R.-J. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 282 KB

Efficient algorithm for reliability of a

✍ Jen-Shyan Wu; Rong-Jaye Chen 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 155 KB

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

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

A fast reliability-algorithm for the cir

✍ Jen-Chun Chang; Rong-Jaye Chen; Hwang, F.K. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 228 KB

An O(k2·log(n)) algorithm for computing

✍ Min-Sheng Lin 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 142 KB

Fast Recursive Algorithm to Evaluate the

✍ Antonopoulou, Ira; Papastavridis, Stavros 📂 Article 📅 1987 🏛 IEEE 🌐 English ⚖ 261 KB