Nmah, Benedict (2017) Achieving System Reliability with the Fewest Identical Components. Journal of Advances in Mathematics and Computer Science, 24 (6). pp. 1-9. ISSN 24569968
![[thumbnail of Nmah2462017JAMCS36521.pdf]](http://eprints.go4mailburst.com/style/images/fileicons/text.png)
Text
Nmah2462017JAMCS36521.pdf - Published Version
Download (195kB)
Official URL: https://doi.org/10.9734/JAMCS/2017/36521
Abstract
Generally, redundancy allocation problems are NP-hard. This paper presents an explicit polynomially bounded algorithm for a special class of redundancy allocation models.
| Item Type: | Article |
|---|---|
| Subjects: | GO for ARCHIVE > Mathematical Science |
| Depositing User: | Unnamed user with email support@goforarchive.com |
| Date Deposited: | 13 May 2023 06:23 |
| Last Modified: | 29 Jan 2024 06:14 |
| URI: | http://eprints.go4mailburst.com/id/eprint/803 |
Actions (login required)
- View Item