Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
DOI10.1007/11889205_17zbMATH Open1160.68551OpenAlexW1956666728WikidataQ60521687 ScholiaQ60521687MaRDI QIDQ3524243FDOQ3524243
Authors: Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevin Leyton-Brown 
Publication date: 9 September 2008
Published in: Principles and Practice of Constraint Programming - CP 2006 (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.6289
Recommendations
- Algorithm runtime prediction: methods \& evaluation
- Empirical hardness models, methodology and a case study on combinatorial auctions
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
- Paramils: an automatic algorithm configuration framework
- Auto-Walksat: A self-tuning implementation of Walksat
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)
Cited In (14)
- Accelerating backtrack search with a best-first-search strategy
- Algorithm runtime prediction: methods \& evaluation
- ASlib: a benchmark library for algorithm selection
- Learning dynamic algorithm portfolios
- Empirical hardness models, methodology and a case study on combinatorial auctions
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Autonomous operator management for evolutionary algorithms
- Practical performance models of algorithms in evolutionary program induction and other domains
- A weighted-sum method for solving the bi-objective traveling thief problem
- Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering
- A Bayesian approach to tackling hard computational problems. (Preliminary report)
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
- Principles for the design of large neighborhood search
- Hierarchical Hardness Models for SAT
This page was built for publication: Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524243)
