A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n : F system
| dc.citation.epage | 474 | en_US |
| dc.citation.issue | 4 | en_US |
| dc.citation.spage | 472 | en_US |
| dc.citation.volume | 47 | en_US |
| dc.contributor.author | Chang, JC | en_US |
| dc.contributor.author | Chen, RJ | en_US |
| dc.contributor.author | Hwang, FK | 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.date.accessioned | 2014-12-08T15:47:15Z | |
| dc.date.available | 2014-12-08T15:47:15Z | |
| dc.date.issued | 1998-12-01 | en_US |
| 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.identifier.doi | 10.1109/24.756092 | 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.756092 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/31700 | |
| 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 |