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

doi:10.1109/24.756092

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Chang, JC	en_US
dc.contributor.author	Chen, RJ	en_US
dc.contributor.author	Hwang, FK	en_US
dc.date.accessioned	2019-04-02T05:58:43Z	-
dc.date.available	2019-04-02T05:58:43Z	-
dc.date.issued	1998-12-01	en_US
dc.identifier.issn	0018-9529	en_US
dc.identifier.uri	http://dx.doi.org/10.1109/24.756092	en_US
dc.identifier.uri	http://hdl.handle.net/11536/148357	-
dc.description.abstract	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.	en_US
dc.language.iso	en_US	en_US
dc.subject	consecutive-k-out-of-n : F system	en_US
dc.subject	consecutive weighted-k-out-of-n : F system	en_US
dc.subject	computation complexity	en_US
dc.title	A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n : F system	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1109/24.756092	en_US
dc.identifier.journal	IEEE TRANSACTIONS ON RELIABILITY	en_US
dc.citation.volume	47	en_US
dc.citation.spage	472	en_US
dc.citation.epage	474	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000079621800012	en_US
dc.citation.woscount	15	en_US
顯示於類別：	期刊論文