A hierarchical approach for bounding the completion time distribution of stochastic task graphs (Q4779269)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A hierarchical approach for bounding the completion time distribution of stochastic task graphs |
scientific article; zbMATH DE number 1835050
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hierarchical approach for bounding the completion time distribution of stochastic task graphs |
scientific article; zbMATH DE number 1835050 |
Statements
A hierarchical approach for bounding the completion time distribution of stochastic task graphs (English)
0 references
27 November 2002
0 references
Shogan algorithm
0 references
Tree\(\_\)Bound method
0 references
