ASlib: a benchmark library for algorithm selection
From MaRDI portal
Publication:286390
DOI10.1016/j.artint.2016.04.003zbMath1357.68202arXiv1506.02465OpenAlexW1471542436WikidataQ59585873 ScholiaQ59585873MaRDI QIDQ286390
Lars Kotthoff, Yuri Malitsky, Kevin Leyton-Brown, Kevin Tierney, Joaquin Vanschoren, Bernd Bischl, Pascal Kerschke, Alexandre Fréchette, Holger H. Hoos, Marius Lindauer, Frank Hutter
Publication date: 20 May 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02465
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A biased random-key genetic algorithm for the container pre-marshalling problem, Algorithm selection on a meta level, Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm, Efficient benchmarking of algorithm configurators via model-based surrogates, A study on the effects of normalized TSP features for automated algorithm selection, On the statistical evaluation of algorithmic's computational experimentation with infeasible solutions, Generation techniques for linear programming instances with controllable properties, \textsc{Alors}: an algorithm recommender system, Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges, Machine learning for combinatorial optimization: a methodological tour d'horizon, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Learning context-dependent choice functions, The algorithm selection competitions 2015 and 2017, Deep learning assisted heuristic tree search for the container pre-marshalling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards objective measures of algorithm performance across instance space
- Experiment databases
- Algorithm runtime prediction: methods \& evaluation
- Learning from planner performance
- A self-adaptive multi-engine solver for quantified Boolean formulas
- Wrappers for feature subset selection
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Another look at graph coloring via propositional satisfiability
- Operations research at container terminals: a literature update
- SUNNY: a Lazy Portfolio Approach for Constraint Solving
- claspfolio2: Advances in Algorithm Selection for Answer Set Programming
- Heuristics for dynamically adapting propagation in constraint satisfaction problems
- Hierarchical Hardness Models for SAT
- Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms
- Metalearning
- ParamILS: An Automatic Algorithm Configuration Framework
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Multi-threaded ASP solving with clasp
- Cell Mapping Techniques for Exploratory Landscape Analysis
- Machine Learning: ECML 2004
- Principles and Practice of Constraint Programming – CP 2004
- Algorithm portfolios
