Arc and path consistence revisited
Artificial Intelligence
Parallel consistent labeling algorithms
International Journal of Parallel Programming
On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
Arc consistency: parallelism and domain dependence
Artificial Intelligence - Special volume on constraint-based reasoning
Arc-consistency and arc-consistency again
Artificial Intelligence
Exploiting problem structure in genetic algorithms
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
SIAM Journal on Computing
Assessing Fast Network Interfaces
IEEE Micro
Interleaved Backtracking in Distributed Constraint Networks
ICTAI '01 Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence
On modeling multiagent task scheduling as a distributed constraint optimization problem
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Communicating sequential processes for distributed constraint satisfaction
Information Sciences: an International Journal
| Hi-index | 0.00 |
This paper presents iDisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of message passing operations. This algorithm can firstly, give speed-up over the fastest central arc-consistency algorithms; secondly, achieve the fast processing of distributed constraint satisfaction problems (DCSP). Experimental results include classical benchmark and large hard randoms problems. These results allow us to show that the phase transition phenomenon of distributed arc-consistency is closely related to the granularity of the distributed system. The consequences of this analysis are showed to be very important for the future of distributed constraint satisfaction.