Optimal speedup of Las Vegas algorithms
Information Processing Letters
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Optimal constructions of hybrid algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Optimal Parallelization of Las Vegas Algorithms
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Optimization Parallelizing for Discrete Programming Problems
Cybernetics and Systems Analysis
Restart strategies in optimization: parallel and serial cases
Parallel Computing
On Maximum Speedup Ratio of Restart Algorithm Portfolios
INFORMS Journal on Computing
| Hi-index | 0.00 |
We consider two parallel strategies for randomized restart algorithms. Given a set of available algorithms, one can either choose the best performing algorithm and run multiple copies of it in parallel (single algorithm portfolio), or choose some subset of algorithms to run in parallel (mixed algorithm portfolio). It has been previously shown in the literature that the latter approach may provide better results. In this paper we investigate the extent of such improvement.