• Computer Science
  • Published in ECAI 2002

Progressive Focusing Search

  title={Progressive Focusing Search},
  author={Nicolas Prcovic and Bertrand Neveu},
This paper deals with value ordering heuristics used in a complete tree search algorithm for solving binary constraint satisfaction problems. Their aim is to guide the search towards a solution. First, we show the limits of the traditional prospective approach, which uses the size of the domains of the still unassigned variables. In an advantageous context, where arc consistency is maintained and allows the time spent by the dynamic value ordering to be negligible, the speedup is poor when the… CONTINUE READING