AN O(KN)-TIME ALGORITHM FOR COMPUTING THE RELIABILITY OF A CIRCULAR CONSECUTIVE-K-OUT-OF-N-F SYSTEM

被引：5

作者：

HWANG, FK

机构：

[1] AT&T Bell Laboratories, Murray Hill

来源：

IEEE TRANSACTIONS ON RELIABILITY | 1993年 / 42卷 / 01期

关键词：

CIRCULAR CONSECUTIVE-K-OUT-OF-N-F SYSTEM; SYSTEM RELIABILITY; ALGORITHM COMPLEXITY;

D O I：

10.1109/24.210289

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Antonopoulou & Papastavridis (1987) published an algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system which claimed O(k . n) time. Wu & Chen (1993) correctly pointed out the algorithm achieved only O(k . n2) time. This paper shows that the algorithm can be implemented for O(k . n) time.

引用

页码：161 / 162

页数：2

共 4 条

[1] FAST RECURSIVE ALGORITHM TO EVALUATE THE RELIABILITY OF A CIRCULAR CONSECUTIVE-K-OUT-OF-N-F-SYSTEM [J].