@Article{bessiere01a,
  author =	 {Christian Bessi\`{e}re and Arnold Maestre and Pedro
                  Meseguer},
  title =	 {Distributed dynamic backtracking},
  journal =	 {Notes of the {IJCAI}'01 Workshop on Distributed
                  Constraint Reasoning, Seattle, WA},
  year =	 2001,
  pages =	 {9--16},
  abstract =	 {In the scope of distributed constraint reasoning,
                  the main algorithms presented so far have a feature
                  in common: the addition of links between previously
                  unrelated agents, before or during search. Our work
                  presents a new search procedure for finding a
                  solution in a distributed constraint satisfaction
                  problem. This algorithm makes use of some of the
                  good properties of centralized dynamic
                  backtracking. It is sound, complete and allows a
                  high level of asynchronism by sidestepping the
                  unnecessary addition of links.},
  keywords =     {multiagent dcsp},
  googleid = 	 {t6uc_h84XpQJ:scholar.google.com/},
  url =		 {http://jmvidal.cse.sc.edu/library/bessiere01a.pdf},
  cluster = 	 {10691044275490958263}
}