225 search results - page 19 / 45 » Dynamic Agent Ordering in Distributed Constraint Satisfactio... |
IAT
2006
IEEE
15 years 5 months ago
2006
IEEE
The Distributed Probabilistic Protocol (DPP) is a new, approximate algorithm for solving Distributed Constraint Satisfaction Problems (DCSPs) that exploits prior knowledge to impr...
CP
2006
Springer
15 years 3 months ago
2006
Springer
We reconsider the idea of structural symmetry breaking (SSB) for constraint satisfaction problems (CSPs). We show that the dynamic dominance checks used in symmetry breaking by dom...
118
click to vote
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
104
click to vote
ICCNMC
2005
Springer
15 years 5 months ago
2005
Springer
The emergence of Internet, Intranet, local area networks, and ad hoc wireless networks introduces a plethora of new problems in information processing. In order to overcome these p...
110
click to vote
REFLECTION
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. Using mobile agent systems, cooperative distributed applications that run over the Internet can be constructed flexibly. However, there are some problems: it is difficul...