559 search results - page 12 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
199
click to vote
CP
2009
Springer
16 years 8 days 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
14 years 11 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...
115
click to vote
CONSTRAINTS
2010
14 years 11 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...
109
click to vote
AUSAI
2003
Springer
15 years 4 months 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...
114
click to vote
FLAIRS
2004
15 years 1 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...