A cut-based method for terminal-pair reliability
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
416 | en_US |
dc.citation.issue |
3 | en_US |
dc.citation.spage |
413 | en_US |
dc.citation.volume |
45 | en_US |
dc.citation.woscount |
28 | |
dc.contributor.author |
Chen, YG | en_US |
dc.contributor.author |
Yuang, MC | en_US |
dc.contributor.department |
交大名義發表 | zh_TW |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
National Chiao Tung University | en_US |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:02:22Z | |
dc.date.available |
2014-12-08T15:02:22Z | |
dc.date.issued |
1996-09-01 | en_US |
dc.description.abstract |
Summ. & Conclusions - This paper assesses two categories of partition techniques for computing terminal-pair reliability (path-based and cut-based algorithms) by experimenting on published benchmarks; the criteria are the number of subproblems and the computation time. The cut-based algorithm is superior to the path-based algorithm with respect to the computation time for most benchmarks. A refinement of the cut-based algorithm (using network reduction) profoundly outperforms the path-based algorithm (with reduction) for all benchmarks. | en_US |
dc.identifier.doi |
10.1109/24.536994 | 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.536994 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/1049 | |
dc.identifier.wosnumber |
WOS:A1996VK79600017 | |
dc.language.iso |
en_US | en_US |
dc.subject |
terminal-pair reliability | en_US |
dc.subject |
factoring | en_US |
dc.subject |
partitioning | en_US |
dc.subject |
network reduction | en_US |
dc.title |
A cut-based method for terminal-pair reliability | en_US |
dc.type |
Article | en_US |
檔案
- A1996VK79600017.pdf (485.0 KB, Adobe PDF)
所屬典藏: 期刊論文