Reliability Analysis of Replicated Directed Acyclic Graphs
碩士 === 國立交通大學 === 資訊科學學系 === 83 === A computation task running in distributed systems can be represented as a directed graph H(V,E) whose vertices and edges may fail with known probabilities. The reliability of the task is defined to be the...
Main Authors: | Ju-Fur Wang, 王朱福 |
---|---|
Other Authors: | Rong-Hong Jan |
Format: | Others |
Language: | en_US |
Published: |
1995
|
Online Access: | http://ndltd.ncl.edu.tw/handle/29869077992385645800 |
Similar Items
-
Directed Acyclic Graph Partitioning
by: Tsung-Han Lin, et al.
Published: (2007) -
Directed acyclic graph kernels for structural RNA analysis
by: Mituyama Toutai, et al.
Published: (2008-07-01) -
Reducing bias through directed acyclic graphs
by: Platt Robert W, et al.
Published: (2008-10-01) -
A Parametric Classification of Directed Acyclic Graphs
by: Chaturvedi, Mmanu
Published: (2017) -
Smoothed nested testing on directed acyclic graphs
by: Fithian, W., et al.
Published: (2022)