@InCollection{fitzpatrick02a,
  author =	 {Stephen Fitzpatrick and Lambert Meertens},
  title =	 {Experiments on Dense Graphs with a Stochastic,
                  Peer-to-Peer Colorer},
  booktitle =	 {Probabilistic Approaches in Search Workshop},
  pages =	 {24--28},
  publisher =	 {{AAAI} Press},
  year =	 2002,
  editor =	 {Carla Gomes and Toby Walsh},
  abstract =	 {This paper reports on a simple, stochastic,
                  scalable, peer-topeer algorithm for aproximately
                  solving distributed constraint problems in soft real
                  time. The performance of the algorithm is assessed
                  using k-colorings of random graphs having known
                  chromatic number and edge probability ranging from
                  moderate to high. variables. The hope is that over
                  time the number of constraints that are actually
                  satisfied increases, and that perhaps eventually all
                  of the constraints are satisfied. However, the
                  algorithm is designed to quickly satisfy many
                  constraints with low communication costs, rather
                  than to ensure ultimate perfection;},
  keywords = 	 {distributed-search},
  url =
                  {http://jmvidal.cse.sc.edu/library/fitzpatrick02a.pdf},
  googleid = 	 {BxUZp-XJkuQJ:scholar.google.com/},
  cluster = 	 {16470448775435457799}
}