225 search results - page 10 / 45 » Dynamic Agent Ordering in Distributed Constraint Satisfactio... |
AAAI
2006
14 years 11 months ago
2006
Many planning and design problems can be characterized as optimal search over a constrained network of conditional choices with preferences. To draw upon the advanced methods of c...
75
Voted
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
102
Voted
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
We propose a new algorithm for solving Distributed Constraint Optimization Problems (DCOPs). Our algorithm, called DyBop, is based on branch and bound search with dynamic ordering ...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...