419 search results - page 49 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
IAT
2007
IEEE
14 years 2 months ago
2007
IEEE
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
We present a new method for instance-specific algorithm configuration (ISAC). It is based on the integration of the algorithm configuration system GGA and the recently proposed sto...
CP
2006
Springer
14 years 6 days ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
AAAI
2007
13 years 10 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
CP
2009
Springer
14 years 9 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...