980 search results - page 7 / 196 » Decentralized Constraint Satisfaction |
CPAIOR
2006
Springer
13 years 11 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...
EJC
2008
13 years 7 months ago
2008
We study certain constraint satisfaction problems which are the problems of deciding whether there exists a homomorphism from a given relational structure to a fixed structure with...
DAGSTUHL
2008
13 years 9 months ago
2008
In a nutshell, a duality for a constraint satisfaction problem equates the existence of one homomorphism to the non-existence of other homomorphisms. In this survey paper, we give ...
IPL
2000
13 years 7 months ago
2000
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
WLP
2004
Springer
14 years 1 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...