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

標題:	A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n : F system
作者:	Chang, JC Chen, RJ Hwang, FK 應用數學系資訊工程學系 Department of Applied Mathematics Department of Computer Science
關鍵字:	consecutive-k-out-of-n : F system;consecutive weighted-k-out-of-n : F system;computation complexity
公開日期:	1-Dec-1998
摘要:	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.
URI:	http://dx.doi.org/10.1109/24.756092 http://hdl.handle.net/11536/31700
ISSN:	0018-9529
DOI:	10.1109/24.756092
期刊:	IEEE TRANSACTIONS ON RELIABILITY
Volume:	47
Issue:	4
起始頁:	472
結束頁:	474
Appears in Collections:	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。