DocumentCode
884106
Title
An O (kn )-time algorithm for computing the reliability of a circular consecutive-k -out-of-n :F system
Author
Hwang, F.K.
Author_Institution
AT&T Bell Lab., Murray Hill, NJ, USA
Volume
42
Issue
1
fYear
1993
fDate
3/1/1993 12:00:00 AM
Firstpage
161
Lastpage
162
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 (kn 2) 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;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/24.210289
Filename
210289
Link To Document