Frugal algorithm selection for combinatorial search

DOI10.1613/JAIR.1.21266MaRDI QIDQ7307209zbMATH OpenFDO

Authors Erdem Kuş, Özgür Akgün, Nguyen Dang, Ian Miguel, Lars Kotthoff

Publication date 31 July 2026

Published in The Journal of Artificial Intelligence Research (JAIR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1613/JAIR.1.21266

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Cites work

• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• Algorithm portfolios
• Algorithm runtime prediction: methods \& evaluation
• ASlib: a benchmark library for algorithm selection
• Orange: data mining toolbox in Python
• Paramils: an automatic algorithm configuration framework
• SATzilla: portfolio-based algorithm selection for SAT
• Statistical comparisons of classifiers over multiple data sets
• The use of ranks to avoid the assumption of normality implicit in the analysis of variance.

This page was built for publication: Frugal algorithm selection for combinatorial search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307209)