论文信息 - Efficient algorithm for reliability of a circular consecutive-k-out-of-n:F system

Efficient algorithm for reliability of a circular consecutive-k-out-of-n:F system

The time complexities of previously published algorithms for circular consecutive-k-out-of-n:F systems are O(nk/sup 2/) and O(nk). The authors propose a method to improve the original O(nk/sup 2/) algorithm, and hence derive an O(nk) algorithm. >

Rong-Jaye Chen | Rong-Jaye Chen | Jen-Shyan Wu | Jen-Shyan Wu

[1] F. Hwang,et al. Fast Solutions for Consecutive-k-out-of-n: F System , 1982, IEEE Transactions on Reliability.

[2] Rong-Jaye Chen,et al. An O(kn) algorithm for a circular consecutive-k-out-of-n:F system , 1992 .

[3] Gerald J. Lieberman,et al. On the Consecutive-k-of-n:F System , 1982, IEEE Transactions on Reliability.

[4] Shun-Chen Niu,et al. Reliability of Consecutive-k-out-of-n:F System , 1981, IEEE Transactions on Reliability.

[5] Stavros Papastavridis,et al. Fast Recursive Algorithm to Evaluate the Reliability of a Circular Consecutive-k-out-of-n:F System , 1987, IEEE Transactions on Reliability.

[6] J. George Shanthikumar,et al. Recursive Algorithm to Evaluate the Reliability of a Consecutive-k-out-of-n:F System , 1982, IEEE Transactions on Reliability.