225 search results - page 22 / 45 » Dynamic Agent Ordering in Distributed Constraint Satisfactio... |
113
Voted
AAAI
2000
15 years 3 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
137
click to vote
ATAL
2011
Springer
14 years 1 months ago
2011
Springer
Distributed systems can often be modeled as a collection of distributed (system) variables whose values are constrained by a set of constraints. In distributed multi-agent systems...
122
click to vote
SIROCCO
2004
15 years 3 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
111
Voted
ECAI
2006
Springer
15 years 5 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...
109
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Recent studies have investigated how a team of mobile sensors can cope with real world constraints, such as uncertainty in the reward functions, dynamically appearing and disappea...