EFFICIENT ALGORITHM FOR RELIABILITY OF A CIRCULAR CONSECUTIVE-K-OUT-OF-N-F SYSTEM
| dc.citation.epage | 164 | en_US |
| dc.citation.issue | 1 | en_US |
| dc.citation.spage | 163 | en_US |
| dc.citation.volume | 42 | en_US |
| dc.citation.woscount | 8 | |
| dc.contributor.author | WU, JS | en_US |
| dc.contributor.author | CHEN, RJ | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:04:36Z | |
| dc.date.available | 2014-12-08T15:04:36Z | |
| dc.date.issued | 1993-03-01 | en_US |
| dc.description.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. | en_US |
| dc.identifier.doi | 10.1109/24.210290 | en_US |
| dc.identifier.issn | 0018-9529 | en_US |
| dc.identifier.journal | IEEE TRANSACTIONS ON RELIABILITY | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1109/24.210290 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/3091 | |
| dc.identifier.wosnumber | WOS:A1993KW36600031 | |
| dc.language.iso | en_US | en_US |
| dc.subject | CIRCULAR CONSECUTIVE-K-OUT-OF-N-F SYSTEM | en_US |
| dc.subject | SYSTEM RELIABILITY | en_US |
| dc.subject | ALGORITHM | en_US |
| dc.title | EFFICIENT ALGORITHM FOR RELIABILITY OF A CIRCULAR CONSECUTIVE-K-OUT-OF-N-F SYSTEM | en_US |
| dc.type | Article | en_US |