An Enhanced Features Extractor for a Portfolio of Constraint Solvers

08/01/2013
by   Roberto Amadini, et al.
0

Recent research has shown that a single arbitrarily efficient solver can be significantly outperformed by a portfolio 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 flexible framework that is able to extract an extensive set of features from a Constraint (Satisfaction/Optimization) Problem defined in possibly different modeling languages: MiniZinc, FlatZinc or XCSP. We also report some empirical results showing that the performances that can be obtained using these features are effective and competitive with state of the art CSP portfolio techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2015

A Multicore Tool for Constraint Solving

*** To appear in IJCAI 2015 proceedings *** In Constraint Programming (C...
research
12/04/2012

An Empirical Evaluation of Portfolios Approaches for solving CSPs

Recent research in areas such as SAT solving and Integer Linear Programm...
research
01/16/2014

Fast Set Bounds Propagation Using a BDD-SAT Hybrid

Binary Decision Diagram (BDD) based set bounds propagation is a powerful...
research
05/31/2019

GENO -- GENeric Optimization for Classical Machine Learning

Although optimization is the longstanding algorithmic backbone of machin...
research
03/29/2017

Experience-based Optimization: A Coevolutionary Approach

This paper studies improving solvers based on their past solving experie...
research
01/31/2010

Dominion -- A constraint solver generator

This paper proposes a design for a system to generate constraint solvers...
research
03/02/2011

Decentralized Constraint Satisfaction

We show that several important resource allocation problems in wireless ...

Please sign up or login with your details

Forgot password? Click here to reset