Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/95486
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Silva, Jaime | - |
dc.contributor.author | Gomes, Teresa Martinez dos Santos | - |
dc.contributor.author | Tipper, David | - |
dc.contributor.author | Martins, Lúcia | - |
dc.contributor.author | Kounev, Velin | - |
dc.date.accessioned | 2021-08-04T14:36:33Z | - |
dc.date.available | 2021-08-04T14:36:33Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | J. Silva, T. Gomes, D. Tipper, L. Martins and V. Kounev, "An algorithm for computing all-terminal reliability bounds," 2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM), 2014, pp. 76-83, doi: 10.1109/RNDM.2014.7014934. | pt |
dc.identifier.isbn | 978-1-4799-7040-7 | - |
dc.identifier.isbn | 978-1-4799-7039-1 | - |
dc.identifier.isbn | 978-1-4799-7038-4 | - |
dc.identifier.uri | https://hdl.handle.net/10316/95486 | - |
dc.description.abstract | The exact calculation of all-terminal reliability is not feasible in large networks. Hence estimation techniques and lower and upper bounds for all-terminal reliability have been utilized. We propose using an ordered subset of the mincuts and an ordered subset of minpaths to calculate an all-terminal reliability upper and lower bound, respectively. The advantage of the proposed approach results from the fact that it does not require the enumeration of all mincuts or all minpaths as required by other bounds. The performance of the algorithm is compared with the first two Bonferroni bounds, for networks where all mincuts could be calculated. The results show that the proposed approach is computationally feasible and reasonably accurate. Thus allowing one to obtain bounds when it not possible to enumerate all mincuts or all minpaths. | pt |
dc.description.sponsorship | FCT - Fundação para a Ciência e a Tecnologia, I.P | pt |
dc.language.iso | eng | pt |
dc.publisher | IEEE | pt |
dc.relation | ICIS Project CENTRO-07- 0224-FEDER-002003 | pt |
dc.relation | PEst-OE/ EEI/UI308/2014 | pt |
dc.rights | embargoedAccess | pt |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | pt |
dc.subject | All-terminal network reliability | pt |
dc.subject | Bonferroni bounds | pt |
dc.subject | Network availability | pt |
dc.subject | Network reduction | pt |
dc.title | An algorithm for computing all-terminal reliability bounds | pt |
dc.type | article | pt |
degois.publication.firstPage | 76 | pt |
degois.publication.lastPage | 83 | pt |
degois.publication.location | Barcelona, Espanha | pt |
dc.relation.publisherversion | https://ieeexplore.ieee.org/document/7014934 | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.1109/RNDM.2014.7014934 | - |
dc.date.embargo | 2014-06-30 | * |
uc.date.periodoEmbargo | 180 | pt |
item.grantfulltext | open | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.fulltext | Com Texto completo | - |
item.openairetype | article | - |
item.cerifentitytype | Publications | - |
item.languageiso639-1 | en | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.researchunit | INESC Coimbra – Institute for Systems Engineering and Computers at Coimbra | - |
crisitem.author.orcid | 0000-0003-4467-7366 | - |
crisitem.author.orcid | 0000-0002-3084-5608 | - |
crisitem.author.orcid | 0000-0002-6534-0159 | - |
Appears in Collections: | FCTUC Eng.Electrotécnica - Artigos em Livros de Actas I&D INESCC - Artigos e Resumos em Livros de Actas |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Silva_et-al_RNDM2014_EstudoGeral.pdf | An Algorithm for Computing All-terminal Reliability Bounds | 316.54 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
7
checked on Sep 2, 2024
Page view(s)
204
checked on Oct 30, 2024
Download(s)
135
checked on Oct 30, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License