Title :
An O(kn)-time algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system
Author_Institution :
AT&T Bell Lab., Murray Hill, NJ, USA
fDate :
3/1/1993 12:00:00 AM
Abstract :
I. Antonopoulou and S. Papastavridis (1987) published an algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system which claimed O (kn) time. J.S. Wu and R.J. Chen (1993) correctly pointed out that the algorithm achieved only O(kn2) time. The present study shows that the algorithm can be implemented for O(kn) time
Keywords :
computational complexity; reliability theory; O(kn)-time algorithm; circular consecutive-k-out-of-n:F system; computational complexity; reliability; time complexity; Algorithm design and analysis; Difference equations; Reliability theory;
Journal_Title :
Reliability, IEEE Transactions on
