2398 search results - page 33 / 480 » Constraint Programming and Graph Algorithms |
CP
2003
Springer
14 years 1 months ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
IPL
2008
13 years 8 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
IJCAI
2001
13 years 9 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
CP
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systemati...