Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
On the Efficiency of Impact Based Heuristics
September 2008
mvc2008b
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.
In proceedings
Marco Correia, Pedro Barahona
P. J. Stuckey
Principles and Practice of Constraint Programming
Lecture Notes in Computer Science
Springer
-
5202/2008
608-612
978-3-540-85957-4
0302-9743
-
http://www.springerlink.com/content/25k0n282447277w2/
Publication files
- click here to download - pdf 165 KB
Export formats
Marco Correia and Pedro Barahona, On the Efficiency of Impact Based Heuristics, in: P. J. Stuckey (eds), Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, Springer, Vol. 5202/2008, ISBN 978-3-540-85957-4, ISSN 0302-9743, Pag. 608-612, (http://www.springerlink.com/content/25k0n282447277w2/), September 2008.
<a href="/people/members/view.php?code=fb427fb6c74794541c445063c270688e" class="author">Marco Correia</a> and <a href="/people/members/view.php?code=7e27bc13fad97e99cd21ea6914d55659" class="author">Pedro Barahona</a>, <b>On the Efficiency of Impact Based Heuristics</b>, in: P. J. Stuckey (eds), <u>Principles and Practice of Constraint Programming</u>, Lecture Notes in Computer Science, <a href="http://www.springer.com" title="Link to external entity..." target="_blank" class="publisher">Springer</a>, Vol. 5202/2008, ISBN 978-3-540-85957-4, ISSN 0302-9743, Pag. 608-612, (<a href="http://www.springerlink.com/content/25k0n282447277w2/" target="_blank">url</a>), September 2008.
@inproceedings {mvc2008b, author = {Marco Correia and Pedro Barahona}, editor = {P. J. Stuckey}, title = {On the Efficiency of Impact Based Heuristics}, booktitle = {Principles and Practice of Constraint Programming}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, volume = {5202/2008}, pages = {608-612}, isbn = {978-3-540-85957-4}, issn = {0302-9743}, url = {http://www.springerlink.com/content/25k0n282447277w2/}, 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.}, month = {September}, year = {2008}, }
Publication's urls
/publications/view.php?code=1406b71dcd8d158da5f336094b7706ce
/publications/view.php?code=mvc2008b
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT