Abstract
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. In this paper we show how we adapted the algorithm selector SUNNY, originally tailored for constraint solving, to deal with general AS problems. Preliminary investigations based on the AS Library benchmarks already show some promising results: for some scenarios SUNNY is able to outperform AS state-ofthe-art approaches.
| Original language | English |
|---|---|
| Journal | CEUR Workshop Proceedings |
| Volume | 1459 |
| Pages (from-to) | 202-206 |
| Number of pages | 5 |
| ISSN | 1613-0073 |
| Publication status | Published - 1. Jan 2015 |
| Externally published | Yes |
| Event | 30th Italian Conference on Computational Logic, CILC 2015 - Genova, Italy Duration: 1. Jul 2015 → 3. Jul 2015 |
Conference
| Conference | 30th Italian Conference on Computational Logic, CILC 2015 |
|---|---|
| Country/Territory | Italy |
| City | Genova |
| Period | 01/07/2015 → 03/07/2015 |