Title: Graph Coloring using Asynchronous Weak-Commitment with the resolved-based learning-- no synchronisation(SEIAS)
Author: Ionel Muscalagiu, Jose M. Vidal
Description: This is the implementation of the Asynchronous Weak-Commitment Search with the resolved-based learning for the graph coloring problem ( no synchronisation-SEIAS ). We solve the graph coloring problem using the AWCS algorithm 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. The Effect of Nogood Learning in Distributed Constraint Satisfaction
  In Proceedings of the 20th IEEE International Conf. on Distributed Computing Systems, pages 169--177, 2000.

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