TY - GEN
T1 - Dynamic selection of enumeration strategies in constraint programming
AU - Crawford, Broderick
AU - Montecinos, Mauricio
AU - Castro, Carlos
AU - Monfroy, Eric
PY - 2009
Y1 - 2009
N2 - In this work we exploit search process features to dynamically adapt a Constraint Programming solver in order to more efficiently solve Constraint Satisfaction Problems. The main novelty of our approach is that we reconfigure the search based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies.
AB - In this work we exploit search process features to dynamically adapt a Constraint Programming solver in order to more efficiently solve Constraint Satisfaction Problems. The main novelty of our approach is that we reconfigure the search based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies.
KW - Constraint programming
KW - Enumeration strategies
KW - Value ordering heuristics
KW - Variable ordering heuristics
UR - http://www.scopus.com/inward/record.url?scp=84904312343&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84904312343
SN - 9783901509704
T3 - Annals of DAAAM and Proceedings of the International DAAAM Symposium
SP - 1331
EP - 1332
BT - Annals of DAAAM for 2009 and Proceedings of the 20th International DAAAM Symposium "Intelligent Manufacturing and Automation
PB - Danube Adria Association for Automation and Manufacturing, DAAAM
T2 - Annals of DAAAM for 2009 and 20th International DAAAM Symposium "Intelligent Manufacturing and Automation: Focus on Theory, Practice and Education"
Y2 - 25 November 2009 through 28 November 2009
ER -