DeepAI
Log In Sign Up

Short Portfolio Training for CSP Solving

05/08/2015
by   Mirko Stojadinović, et al.
0

Many different approaches for solving Constraint Satisfaction Problems (CSPs) and related Constraint Optimization Problems (COPs) exist. However, there is no single solver (nor approach) that performs well on all classes of problems and many portfolio approaches for selecting a suitable solver based on simple syntactic features of the input CSP instance have been developed. In this paper we first present a simple portfolio method for CSP based on k-nearest neighbors method. Then, we propose a new way of using portfolio systems --- training them shortly in the exploitation time, specifically for the set of instances to be solved and using them on that set. Thorough evaluation has been performed and has shown that the approach yields good results. We evaluated several machine learning techniques for our portfolio. Due to its simplicity and efficiency, the selected k-nearest neighbors method is especially suited for our short training approach and it also yields the best results among the tested methods. We also confirm that our approach yields good results on SAT domain.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/01/2011

Simple Algorithm Portfolio for SAT

The importance of algorithm portfolio techniques for SAT has long been n...
01/16/2014

Fast Set Bounds Propagation Using a BDD-SAT Hybrid

Binary Decision Diagram (BDD) based set bounds propagation is a powerful...
12/04/2012

An Empirical Evaluation of Portfolios Approaches for solving CSPs

Recent research in areas such as SAT solving and Integer Linear Programm...
09/03/2015

Building a Truly Distributed Constraint Solver with JADE

Real life problems such as scheduling meeting between people at differen...
11/12/2022

Far Away in the Deep Space: Nearest-Neighbor-Based Dense Out-of-Distribution Detection

The key to out-of-distribution detection is density estimation of the in...
06/20/2020

Learning Objective Boundaries for Constraint Optimization Problems

Constraint Optimization Problems (COP) are often considered without suff...
11/15/2019

Smarter Features, Simpler Learning?

Earlier work on machine learning for automated reasoning mostly relied o...