Abstract
Recently proposed impact based heuristics have been shown to outperform other instances of the first-fail policy such as the common dom and dom/deg heuristics. This paper compares the behaviour of a constraint and a variable centered impact based heuristic and relates it to the amount of constraint propagation inherent to the model of the problem. Additionally, it presents results which suggest that a lookahead impact heuristic we recently proposed might be the best choice for problems with low locality and where constraint propagation plays an important role. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Correia, M., & Barahona, P. (2008). On the efficiency of impact based heuristics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5202 LNCS, pp. 608–612). Springer Verlag. https://doi.org/10.1007/978-3-540-85958-1_51
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
