2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing Mixing Protocol based on the Cooperation and the Parallelism for the Distributed Environment August 06-August 08 ISBN: 978-0-7695-3263-9
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SNPD.2008.171
Cooperation and parallelism are means for increasing efficiency of search. However, these aspects become a downside, when do not use good strategy for cooperation and parallelism so that to remedy this. We propose to take these aspects into account by studying, choice of the strategy of cooperation and parallelism. Firstly, In this paper, we present a new algorithm specifically designed for solving Distributed Constraint Satisfaction Problems (DisCSPs), and based on these concepts. Then, we prove the soundness and completeness of this method, give some experimental results, and evaluate our method against existing methods. Secondly, we argue the possibility of extension of this mechanism to another model.
Index Terms:
Distributed Constraint Satisfaction, Parallelism, Cooperation, Multi-agent system
Citation:
Belaid Saad, Francine Herrmann, Yann Lanuel, Thomas Tamisier, "Mixing Protocol based on the Cooperation and the Parallelism for the Distributed Environment," snpd, pp.981-986, 2008 Ninth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2008 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||