@Article{yokoo92a,
  author =	 {Makoto Yakoo and Edmund H. Durfee and Toru Ishida
                  and Kazuhiro Kuwabara},
  title =	 {Distributed Constraint Satisfaction for Formalizing
                  Distributed Problem Solving},
  journal =	 {12th IEEE International Conference on Distributed
                  Computing Systems '92},
  year =	 1992,
  abstract =	 { Viewing cooperative distributed problem solving
                  (CDPS) as distributed constraint satisfaction
                  provides a useful formalism for characterizing CDPS
                  techniques. This formalism and algorithms for
                  solving distributed constraint satisfaction problems
                  (DCSPs) are compared. A technique called
                  asynchronous backtracking that allows agents to act
                  asynchronously and concurrently, in contrast to the
                  traditional sequential backtracking techniques used
                  in constraint satisfaction problems, is
                  presented. Experimental results show that solving
                  DCSPs in a distributed fashion is worthwhile when
                  the problems solved by individual agents are loosely
                  coupled},
  keywords =     {multiagent dcsp},
  doi =		 {10.1109/ICDCS.1992.235101},
  googleid =	 {LEJTZVK_XzQJ:scholar.google.com/},
  pages =	 {614--621},
  cluster = 	 {3773945373367943724}
}