The Promise of Polynomial-based Local Search to Boost Boolean MAX-CSP Solvers
نویسندگان
چکیده
We propose a novel family of polynomial-based local search algorithms for MAX-CSP. From this family, we present an optimal, fast algorithm, called Evergreen local search (ELS). We evaluate ELS as a preprocessor for state-of-the-art MAX-CSP and MAX-SAT solvers which shows promising improvement in speed and quality.
منابع مشابه
Max-CSP competition 2006: toolbar/toulbar2 solver brief description
This document gives a brief description of the key techniques used in four different versions of toolbar/toulbar2 solvers submitted to the Max-CSP competition 2006. All the solvers exploit an initial upper bound found by a local search solver : maxwalksat [13] (with 5 tries) for toolbar/MaxSAT and INCOP [11] for the other solvers. The solvers are implemented in C code, except for toulbar2 in C++.
متن کاملThe Approximability of Three-valued MAX CSP
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to assign values from a given domain to the variables so as to maximize the number (or the total weight, for the weighted case) of satisfied constraints. This problem is NP-hard in general, and, therefore, it is natural t...
متن کاملParallel Search for Boolean Optimization
The predominance of multicore processors has increased the interest in developing parallel Boolean Satisfiability (SAT) solvers. As a result, more parallel SAT solvers are emerging. Even though parallel approaches are known to boost performance, parallel approaches developed for Boolean optimization are scarce. This paper proposes parallel search algorithms for Boolean optimization and introduc...
متن کاملProblem Transformations and Algorithm Selection for CSPs
A constraint satisfaction problem (CSP) provides a powerful paradigm to model a large number of practical problems such as scheduling, planning, vehicle routing, configuration, network design, routing and wavelength assignment. An instance of a CSP is represented by a set of variables, each of which can be assigned a value from its domain. The assignments to the variables must be consistent wit...
متن کاملImproving the efficiency of learning CSP solvers
Backtracking CSP solvers provide a powerful framework for search and reasoning. The aim of constraint learning is increase global reasoning power by learning new constraints to boost reasoning and hopefully reduce search effort. In this thesis constraint learning is developed in several ways to make it faster and more powerful. First, lazy explanation generation is introduced, where explanation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007