Showing papers on "Bounding overwatch published in 1985"
TL;DR: A new method is presented for obtaining a probability distribution function that bounds the exact probability distribution of the project completion time from below and it is proved that this bounding distribution is better tighter than any of the existing lower bounds.
Abstract: We consider the PERT model of a project composed of activities whose durations are random variables with known distributions. For the situations in which the activity durations are completely independent, we present a new method for obtaining a probability distribution function that bounds the exact probability distribution of the project completion time from below. The bounding distribution can be used to obtain an upper bound on the mean completion time of the project. We also prove and illustrate that this bounding distribution is better tighter than any of the existing lower bounds, implying that the corresponding upper bound on the mean completion time is tighter than any of the existing upper bounds.
181 citations
01 Jul 1985
TL;DR: Two types of bounding volume are studied, describing how their intersection with a ray can be computed and how their size can be derived from the stochastic characteristics of these surfaces.
Abstract: Recently published papers have shown that, with appropriate intersection algorithms, the rendering of many procedural objects is possible with all the advantages offered by the ray-tracing techniques. In the case of stochastic surfaces, the intersection can be computed by a recursive subdivision technique. The efficiency of this algorithm depends essentially on the bounding volume whose size and shape are directly related to the stochastic characteristics of these surfaces. After a brief review of the rendering of stochastic surfaces and the bounding volume selection problem, two types of bounding volume are studied, describing how their intersection with a ray can be computed and how their size can be derived from the stochastic characteristics. The efficiency then, of these bounding volumes are compared.
53 citations
TL;DR: A simple method is exhibited for obtaining sequences which tend quadratically to α1/p from above and below.
Abstract: A simple method is exhibited for obtaining sequences which tend quadratically to α1/p from above and below.