@Article{jiang06c,
  author =	 {Hong Jiang and Jos\'{e} M. Vidal},
  title =	 {The Message Management Asynchronous Backtracking
                  Algorithm},
  journal =	 {Journal of Experimental and Theoretical Artificial
                  Intelligence},
  year =	 2008,
  volume = 	 20,
  number = 	 2,
  pages = 	 {95--110},
  doi = 	 {10.1080/09528130701478629},
  cluster = 	 {7431841895756229677},
  abstract =	 { This paper shows how the Asynchronous Backtracking
                  algorithm, a well known distributed constraint
                  satisfaction algorithm, produces unnecessary
                  messages and introduces our optimized algorithm,
                  Message Management Asynchronous Backtracking, which
                  reduces the number of messages the agents send. The
                  message management mechanism removes the redundant
                  messages, keeps message queue updated, and handles
                  messages by package instead of individually in order
                  to improve efficiency. Our test results show the
                  algorithm significantly reduces the total number of
                  messages sent and drastically reduces the number of
                  cycles used when solving instances of the graph
                  coloring problem.},
  url = 	 {http://jmvidal.cse.sc.edu/papers/jiang06c.pdf},
  keywords = 	 {multiagent dcsp}
}