Algorithm portfolios
From MaRDI portal
Publication:5940819
DOI10.1016/S0004-3702(00)00081-3zbMath0969.68047MaRDI QIDQ5940819
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
empirical evaluation; algorithm portfolios; anytime algorithms; cost profiles; randomized algorithms
68P10: Searching and sorting
Related Items
On algorithm portfolios and restart strategies, A competitive and cooperative approach to propositional satisfiability, Learning dynamic algorithm portfolios, A self-adaptive multi-engine solver for quantified Boolean formulas, Graph coloring by multiagent fusion search, A study of mechanisms for improving robotic group performance, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, A unified framework for partial and hybrid search methods in constraint programming, Learning parallel portfolios of algorithms, APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM, Synthesizing Small and Reliable Tile Sets for Patterned DNA Self-assembly
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal speedup of Las Vegas algorithms
- Embedding partial Steiner triple systems is NP-complete
- A method for obtaining randomized algorithms with small tail probabilities
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Critical behavior in the computational cost of satisfiability testing
- The Non-Existence of Finite Projective Planes of Order 10
- New methods to color the vertices of a graph
