A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n : F system

檔案

日期

1998-12-01

類型

期刊名稱

IEEE TRANSACTIONS ON RELIABILITY

卷期與頁次

第 47 卷第 4 期,頁 472–474

ISSN

0018-9529

語言

英文

摘要

An O(Tn) algorithm is presented for the circular consecutive-weighted-k-out-of-n:F system, where T less than or equal to min[n, [(k - w(max))/w(min)] + 1]; w(max), w(min) are the maximum, minimum weights of all components. This algorithm is simpler and more efficient than the Wu & Chen O(min[n,k] . n) algorithm. When all weights are unity, this algorithm is simpler than other O(k . n) published algorithms.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chang, J., Chen, R., & Hwang, F. (1998). A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n : F system. IEEE TRANSACTIONS ON RELIABILITY, 47(4), 472–474. https://doi.org/10.1109/24.756092

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31700