Sciweavers

5015 search results - page 846 / 1003
» Model Checking a Path
Sort
View
SODA
1998
ACM
99views Algorithms» more  SODA 1998»
13 years 11 months ago
Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
Ashish Goel, Monika Rauch Henzinger, Serge A. Plot...
WSC
1998
13 years 11 months ago
Exploiting Multiple Regeneration Sequences in Simulation Output Analysis
The regenerative method of simulation output analysis exploits the regenerative structure of a stochastic process to break up a path into independent and identically distributed c...
James M. Calvin, Marvin K. Nakayama
WSC
1998
13 years 11 months ago
A Comparison of RESTART Implementations
The RESTART method is a widely applicable simulation technique for the estimation of rare event probabilities. The method is based on the idea to restart the simulation in certain...
Marnix J. J. Garvels, Dirk P. Kroese
WSC
1997
13 years 11 months ago
Computational Experience with the Batch Means Method
This article discusses implementation issues for the LBATCH and ABATCH batch means procedures of Fishman and Yarberry (1997). Theses procedures dynamically increase the batch size...
Christos Alexopoulos, George S. Fishman, Andrew F....
EUROPAR
2010
Springer
13 years 11 months ago
Estimating and Exploiting Potential Parallelism by Source-Level Dependence Profiling
Manual parallelization of programs is known to be difficult and error-prone, and there are currently few ways to measure the amount of potential parallelism in the original sequent...
Jonathan Mak, Karl-Filip Faxén, Sverker Jan...