559 search results - page 12 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
CP
2009
Springer
14 years 8 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
AAMAS
2000
Springer
13 years 7 months ago
2000
Springer
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
CONSTRAINTS
2010
13 years 7 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
AUSAI
2003
Springer
14 years 23 days ago
2003
Springer
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
FLAIRS
2004
13 years 9 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...