Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис: http://hdl.handle.net/20.500.12188/24008
DC FieldValueLanguage
dc.contributor.authorMihova, Marijaen_US
dc.contributor.authorStojkovic, Natashaen_US
dc.contributor.authorPopeska, Zanetaen_US
dc.date.accessioned2022-10-31T14:10:21Z-
dc.date.available2022-10-31T14:10:21Z-
dc.date.issued2008-
dc.identifier.urihttp://hdl.handle.net/20.500.12188/24008-
dc.description.abstractThe problem that we regard in this paper is known as the multi-state two-terminal reliability computation, and we consider how the concept of the minimal path and cut vectors is used in modeling the reliability of these types of systems. The main focus is to develop an algorithm for obtaining minimal path vectors for multi-state two-terminal network. The proposed algorithm differs from the other known algorithms for this problem, because it does not request any restrictions for the values of the capacities of the links. Some examples to illustrate the algorithm are included.en_US
dc.subjectReliability, multi-state systems, network reliability, minimal path vectorsen_US
dc.titleAn algorithm for calculating multi-state network reliability with arbitrary capacities of the linksen_US
dc.typeProceedingsen_US
dc.relation.conferenceInternational Scientific Conference Computer Science’2008en_US
item.fulltextWith Fulltext-
item.grantfulltextopen-
crisitem.author.deptFaculty of Computer Science and Engineering-
Appears in Collections:Faculty of Computer Science and Engineering: Conference papers
Files in This Item:
File Опис SizeFormat 
page170 copy.pdf101.73 kBAdobe PDFView/Open
Прикажи едноставен запис

Page view(s)

47
checked on 3.5.2025

Download(s)

14
checked on 3.5.2025

Google ScholarTM

Проверете


Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.