711 search results - page 28 / 143 » Amalgams of Constraint Satisfaction Problems |
115
click to vote
ICDCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
CCS
2001
ACM
15 years 4 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
113
click to vote
AI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...
118
click to vote
WLP
2004
Springer
15 years 5 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)...
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...