Title: Graph Coloring using Asynchronous Weak-Commitment with nogood processor centralized -SIES
Author: Ionel Muscalagiu
Description: This is the implementation of the Asynchronous Weak-Commitment Search with nogood processor for the graph coloring problem. We adapt the nogood processor technique from

• Armstrong A., Durfee E. Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems.
  In. Proceedings of the 15th IJCAI, Nagoya, Japan, 620-625, 1997.

We solve the graph coloring problem using the AWCS algorithm (with nogood processor centralized) from

• Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review.
  Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.
• Katsutoshi Hirayama and Makoto Yokoo. Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques. Journal "INFORMATICA" Lithuania, Vol. 17, Nr 1, 2006, pp (39-54).

Created with NetLogo . View/download model file: AWCSgc-nogood processor.nlogo