𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating the longest path length of a stochastic DAG by a normal distribution in linear time

✍ Scribed by Ei Ando; Toshio Nakata; Masafumi Yamashita


Book ID
118475175
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
374 KB
Volume
7
Category
Article
ISSN
1570-8667

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Algorithms to calculate the distribution
✍ Lawrence M. Leemis; Matthew J. Duggan; John H. Drew; Jeffrey A. Mallozzi; Kerry πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 397 KB

## Abstract We develop algorithms to calculate the probability distribution of the longest path of an arbitrary stochastic activity network with continuous activity durations by three techniques: recursive Monte Carlo simulation, series‐parallel reduction, and conditioning. Examples illustrate the

Statistical Comparison of Band Spectral
✍ Dr. B. Schack; Dr. H. Wagner; Dr. H. Witte πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 436 KB πŸ‘ 2 views

In this study the distribution of estimated broad ban(-spectral power is evaluated. Under weak assumptions it is possible to appropriate this distribution by a Z'distribution and to construct tolerance intervals with great statistical accuracy. The theoretical results implicate a new methodical basi