97 search results - page 16 / 20 » Algorithms for Distributed Constraint Satisfaction: A Review |
AIPS
1994
14 years 11 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
JAIR
2008
14 years 9 months ago
2008
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
88
Voted
TII
2008
14 years 9 months ago
2008
In distributed real-time systems, meeting the real-time constraints is mandatory but the satisfaction of other application-dependent criteria is most generally required as well. I...
SAC
2006
ACM
15 years 3 months ago
2006
ACM
This paper addresses design exploration for protocols that are employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects repl...
116
click to vote
DEBS
2011
ACM
14 years 1 months ago
2011
ACM
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...