Heyman Daniel P.

Daniel P. Heyman

Information about the author Daniel P. Heyman will soon be added to the site.
Found 6 papers in total
Sizing backbone internet links
Sizing backbone internet links
2005
One of the distinguishing features of a backbone link is that it is designed to carry...
A parallel implementation of the Grassman–Taksar–Heyman algorithm
A parallel implementation of the Grassman–Taksar–Heyman algorithm
1997
The Grassman–Taksar–Heyman algorithm is a direct algorithm for computing...
Comparisons between aggregation/disaggregation and a direct algorithm for computing the stationary probabilities of a Markov chain
Comparisons between aggregation/disaggregation and a direct algorithm for computing the stationary probabilities of a Markov chain
1995
Aggregation/disaggregation is an iterative scheme that leads to an algorithm for...
On the choice of alternative measures in importance sampling with Markov chains
On the choice of alternative measures in importance sampling with Markov chains
1995
In the simulation of Markov chains, importance sample involes replacing the original...
Potentially unlimited variance reduction in importance sampling of Markov chains
Potentially unlimited variance reduction in importance sampling of Markov chains
1996
The authors consider the application of importance sampling in steady-state...
Another way to solve complex chemical equilibria
Another way to solve complex chemical equilibria
1990
T.W. Wall, D. Greening and R.E.D. Woolsey produced a geometric programming based...
Papers per page: