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.>
No takes yet. Share an insight, caveat, or question.
Wu et al. (1993) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: