SUNNY for algorithm selection: A preliminary study

Roberto Amadini; Fabio Biselli; Maurizio Gabbrielli; Tong Liu; Jacopo Mauro

SUNNY for algorithm selection: A preliminary study

Roberto Amadini, Fabio Biselli, Maurizio Gabbrielli, Tong Liu, Jacopo Mauro

Publikation: Bidrag til tidsskrift › Konferenceartikel › Forskning › peer review

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.

Originalsprog	Engelsk
Tidsskrift	CEUR Workshop Proceedings
Vol/bind	1459
Sider (fra-til)	202-206
Antal sider	5
ISSN	1613-0073
Status	Udgivet - 1. jan. 2015
Udgivet eksternt	Ja
Begivenhed	30th Italian Conference on Computational Logic, CILC 2015 - Genova, Italien Varighed: 1. jul. 2015 → 3. jul. 2015

Konference

Konference	30th Italian Conference on Computational Logic, CILC 2015
Land/Område	Italien
By	Genova
Periode	01/07/2015 → 03/07/2015

Dokumenter og links

https://hal.inria.fr/hal-01227595

Citationsformater

@inproceedings{fbbd805205904a0e9afd473163ed6988,

title = "SUNNY for algorithm selection: A preliminary study",

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.",

author = "Roberto Amadini and Fabio Biselli and Maurizio Gabbrielli and Tong Liu and Jacopo Mauro",

year = "2015",

month = jan,

day = "1",

language = "English",

volume = "1459",

pages = "202--206",

journal = "CEUR Workshop Proceedings",

issn = "1613-0073",

publisher = "CEUR-WS.org",

note = "30th Italian Conference on Computational Logic, CILC 2015 ; Conference date: 01-07-2015 Through 03-07-2015",

}

TY - GEN

T1 - SUNNY for algorithm selection

T2 - 30th Italian Conference on Computational Logic, CILC 2015

AU - Amadini, Roberto

AU - Biselli, Fabio

AU - Gabbrielli, Maurizio

AU - Liu, Tong

AU - Mauro, Jacopo

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

M3 - Conference article

AN - SCOPUS:84950317606

SN - 1613-0073

VL - 1459

SP - 202

EP - 206

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

Y2 - 1 July 2015 through 3 July 2015

ER -