EFFICIENT ALGORITHM FOR RELIABILITY OF A CIRCULAR CONSECUTIVE-K-OUT-OF-N-F SYSTEM
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
DOI
10.1109/24.210290
Abstract
The time complexities of previously published algorithms for circular consecutive-k-out-of-n:F system are O(n . k2) and O(n . k). This paper proposes a method to improve upon the original O(n . k2) algorithm and hence derives an O(n . k) algorithm.