569 search results - page 6 / 114 » An Efficient Algorithm for Solving Dynamic Complex DCOP Prob... |
CONPAR
1992
14 years 20 days ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...
ATAL
2010
Springer
13 years 9 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...
ATAL
2009
Springer
14 years 3 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
AIPS
2008
13 years 11 months ago
2008
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...