#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2013

2017

- This year (3)
- Last 5 years (28)
- Last 10 years (28)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
- TPLP
- 2014

Within the context of constraint solving, a portfolio approach allows one to exploit the synergy between different solvers in order to create a globally better solver. In this paper we present SUNNY: a simple and flexible algorithm that takes advantage of a portfolio of constraint solvers in order to compute without learning an explicit model a schedule of… (More)

- Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
- CPAIOR
- 2013

Recent research in areas such as SAT solving and Integer Linear Programming has shown that the performances of a single arbitrarily efficient solver can be significantly outperformed by a portfolio of possibly slower on-average solvers. We report an empirical evaluation and comparison of portfolio approaches applied to Constraint Satisfaction Problems… (More)

- Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
- IJCAI
- 2015

In Constraint Programming (CP), a portfolio solver uses a variety of different solvers for solving a given Constraint Satisfaction / Optimization Problem. In this paper we introduce sunny-cp2: the first parallel CP portfolio solver that enables a dynamic, cooperative, and simultaneous execution of its solvers in a multicore setting. It incorporates… (More)

Recent research has shown that a single arbitrarily efficient solver can be significantly outperformed by a <i>portfolio</i> of possibly slower on-average solvers. The solver selection is usually done by means of (un)supervised learning techniques which exploit features extracted from the problem specification. In this paper we present an useful and… (More)

- Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
- Annals of Mathematics and Artificial Intelligence
- 2014

Within the Constraint Satisfaction Problems (CSP) context, a methodology that has proven to be particularly performant consists of using a portfolio of different constraint solvers. Nevertheless, comparatively few studies and investigations have been done in the world of Constraint Optimization Problems (COP). In this work, we provide a generalization to… (More)

- Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
- ArXiv
- 2013

The Constraint Programming (CP) paradigm allows to model and solve Constraint Satisfaction/Optimization Problems (CSPs/COPs). A CP Portfolio Solver is a particular constraint solver that takes advantage of a portfolio of different CP solvers in order to solve a given problem by properly exploiting Algorithm Selection techniques. In this work we present… (More)

- Roberto Amadini, Imane Sefrioui, Jacopo Mauro, Maurizio Gabbrielli
- IJIMAI
- 2013

Disasters like terrorist attacks, earthquakes, hurricanes, and volcano eruptions are usually unpredictable events that affect a high number of people. We propose an approach that could be used as a decision support tool for a post-disaster response that allows the assignment of victims to hospitals and organizes their transportation via emergency vehicles.… (More)

- Roberto Amadini, Peter J. Stuckey
- CP
- 2014

Scheduling a subset of solvers belonging to a given portfolio has proven to be a good strategy when solving Constraint Satisfaction Problems (CSPs). In this paper, we show that this approach can also be effective for Constraint Optimization Problems (COPs). Unlike CSPs, sequential execution of optimization solvers can communicate information in the form of… (More)

- Roberto Amadini, Maurizio Gabbrielli, Jacopo Mauro
- LOPSTR
- 2015