@Article{bessiere05a,
  author =	 {Christian Bessi\`{e}re and Arnold Maestre and Ismel
                  Brito and Pedro Meseguer},
  title =	 {Asynchronous backtracking without adding links: a
                  new member in the {ABT} family},
  journal =	 {Artificial Intelligence},
  year =	 2005,
  volume =	 161,
  pages =	 {7--24},
  abstract =	 {Following the pioneer work of Yokoo and colleagues
                  on the ABT (asynchronous backtracking) algorithm,
                  several ABT-based procedures have been proposed for
                  solving distributed constraint networks. They differ
                  in the way they store nogoods, but they all use
                  additional communication links between unconnected
                  agents to detect obsolete information. In this
                  paper, we propose a new asynchronous backtracking
                  algorithm which does not need to add links between
                  initially unconnected agents. To make the
                  description simpler and to facilitate the
                  comparisons between algorithms, we present a
                  unifying framework from which the new algorithm we
                  propose, as well as existing ones, are derived. We
                  provide an experimental evaluation of these
                  algorithms.},
  keywords =     {multiagent dcsp},
  url =		 {http://jmvidal.cse.sc.edu/library/bessiere05a.pdf},
  doi =		 {10.1016/j.artint.2004.10.002},
  googleid =	 {RJZdyj915E0J:scholar.google.com/},
  cluster = 	 {5612739952449001028}
}