391 search results - page 1 / 79 » Locally Consistent Constraint Satisfaction Problems with Bin... |
WG
2005
Springer
13 years 9 months ago
2005
Springer
CPAIOR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
CP
1999
Springer
13 years 8 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
SAC
2000
ACM
13 years 8 months ago
2000
ACM
AAAI
2006
13 years 5 months ago
2006
Set variables are ubiquitous in modeling (soft) constraint problems, but efforts on practical consistency algorithms for Weighted Constraint Satisfaction Problems (WCSPs) have onl...