Experimental Evaluation of DisCSP Algorithms Academic Article uri icon

abstract

  • Chapter 5, Chapter 6, and Chapter 7 presented three different DisCSP search algorithms. In addition, the simplest distributed constraints search algorithm is synchronous backtracking (or synchronous backjumping), which was introduced in Chapter 4. As we already mentioned, SBJ was found empirically to outperform asynchronous backtracking when a good ordering heuristic is used [11]. We turn now to an extensive empirical evaluation of the main DisCSP search algorithms. First and foremost we will compare ABT to all other …

publication date

  • January 1, 2008