Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
From MaRDI portal
Publication:3524243
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
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
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Empirical hardness models, methodology and a case study on combinatorial auctions
- 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)
