International audience; Given a collection of algorithms, the Algorithm Selection (AS) problem consists in identifying which of them is the best one for solving a given problem. The selection depends on a set of numerical features that characterize the problem to solve.... View more
 R. Amadini, F. Biselli, M. Gabbrielli, T. Liu, and J. Mauro. SUNNY for Algorithm Selection: A Preliminary Study. In CILC, 2015. Available at: http://www.cs.unibo.it/ amadini/cilc 2015.pdf.
 R. Amadini, M. Gabbrielli, and J. Mauro. SUNNY: a Lazy Portfolio Approach for Constraint Solving. TPLP, 14(4-5):509-524, 2014.
 R. Amadini, M. Gabbrielli, and J. Mauro. A multicore tool for constraint solving. In IJCAI, pages 232-238. AAAI Press, 2015.
 R. Amadini, M. Gabbrielli, and J. Mauro. Portfolio approaches for constraint optimization problems. AMAI, pages 1-18, 2015.
 R. Amadini, M. Gabbrielli, and J. Mauro. SUNNY-CP: a sequential CP portfolio solver. In SAC, pages 1861-1867. ACM, 2015.
 B. Bischl, P. Kerschke, L. Kotthoff, M. Lindauer, Y. Malitsky, A. Fre´- chette, H. Hoos, F. Hutter, K. Leyton-Brown, K. Tierney, and J. Vanschoren. Aslib: A benchmark library for algorithm selection. arXiv preprint arXiv:1506.02465, 2015.
 C. Fawcett, M. Vallati, F. Hutter, J. Hoffmann, H. H. Hoos, and K. Leyton-Brown. Improved features for runtime prediction of domainindependent planners. In ICAPS. AAAI, 2014.
 I. P. Gent, C. Jefferson, L. Kotthoff, I. Miguel, N. C. A. Moore, P. Nightingale, and K. E. Petrie. Learning when to use lazy learning in constraint solving. In ECAI, pages 873-878, 2010.
 I. P. Gent, C. Jefferson, and I. Miguel. Minion: A fast scalable constraint solver. In ECAI, pages 98-102, 2006.
 C. P. Gomes and B. Selman. Algorithm portfolios. Artif. Intell., 126(1- 2):43-62, 2001.