Approximating the longest path length of a stochastic DAG by a normal distribution in linear time-Reference-Cited by-同舟云学术

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

Published:2009-12 Issue:4 Volume:7 Page:420-438
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Ando Ei,Nakata Toshio,Yamashita Masafumi

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference13 articles.

1. Network reliability;Ball,1995

2. M. Berkelaar, Statistical delay calculation, a linear time method, in: Proc. the International Workshop on Timing Analysis (TAU '97), 1997, pp. 15–24

3. The greatest of a finite set of random variables;Clark;Operations Research,1961

4. The PERT model for the distribution of an activity time;Clark;Operations Research,1962

5. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Fast, Provably Accurate Approximation Algorithm for Sparse Principal Component Analysis Reveals Human Genetic Variation Across the World;2022-04-22

2. A stochastic algorithm for scheduling bag-of-tasks applications on hybrid clouds under task duration variations;Journal of Systems and Software;2022-02

3. Crowdsource-enabled integrated production and transportation scheduling for smart city logistics;International Journal of Production Research;2020-09-01

4. Practical Multicore Extension of Functionally and Temporally Correct Real-Time Simulation for Automotive Systems;Cyber Physical Systems. Model-Based Design;2020

5. Performability Evaluation and Optimization of Workflow Applications in Cloud Environments;Journal of Grid Computing;2019-01-17