Optimal speedup of Las Vegas algorithms
@article{Luby1993OptimalSO, title={Optimal speedup of Las Vegas algorithms}, author={M. Luby and A. Sinclair and David Zuckerman}, journal={[1993] The 2nd Israel Symposium on Theory and Computing Systems}, year={1993}, pages={128-133} }
Let A be a Las Vegas algorithm, i.e., A is a randomized algorithm that always produces the correct answer when its stops but whose running time is a random variable. The authors consider the problem of minimizing the expected time required to obtain an answer from A using strategies which simulate A as follows: run A for a fixed amount of time t/sub 1/, then run A independent for a fixed amount of time t/sub 2/, etc. The simulation stops if A completes its execution during any of the runs. Let… CONTINUE READING
Topics from this paper
304 Citations
Completion Probabilities and Parallel Restart Strategies under an Imposed Deadline
- Mathematics, Medicine
- PloS one
- 2016
- 3
- PDF
Characterization of a New Restart Strategy for Randomized Backtrack Search
- Mathematics, Computer Science
- CSCLP
- 2004
- 4
- PDF
LEAPSANDBOUNDS: A Method for Approximately Optimal Algorithm Configuration
- Computer Science, Mathematics
- ICML
- 2018
- 16
- PDF
Theoretical results on bet-and-run as an initialisation strategy
- Computer Science, Mathematics
- GECCO
- 2017
- 6
- PDF
Strategies for Solving SAT in Grids by Randomized Search
- Computer Science
- AISC/MKM/Calculemus
- 2008
- 18
- Highly Influenced
- PDF
Estimating parallel runtimes for randomized algorithms in constraint solving
- Computer Science
- J. Heuristics
- 2016
- 10
- PDF
References
SHOWING 1-2 OF 2 REFERENCES