Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Comparing two approaches to dynamic, distributed constraint satisfaction
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Support-based distributed search: a new approach for multiagent constraint processing
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Nogood based asynchronous distributed optimization (ADOPT ng)
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
No-commitment branch and bound search for distributed constraint optimization
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
A scalable method for multiagent constraint optimization
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Using distributed agents for patient scheduling
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
| Hi-index | 0.00 |
Here we introduce a novel algorithm for continual optimisation of dynamic distributed constraint optimisation problems. By using techniques derived from argumentation for communication the algorithm does not need to use an ordering over the variables. The lack of a hierarchy allows the algorithm to efficiently solve dynamic problems, as well as be completely asynchronous, fault tolerant and anytime. However it prevents an ordered search, making the algorithm incomplete.