首页 | 本学科首页   官方微博 | 高级检索  
     


An O(kn)-time algorithm for computing thereliability of a circular consecutive-k-out-of-n:Fsystem
Authors:Hwang  FK
Affiliation:AT&T Bell Lab., Murray Hill, NJ;
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:
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号