TY - GEN
T1 - A choice function to dynamic selection of enumeration strategies solving constraint satisfaction problems
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 searching or search process 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 searching or search process 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=77649280135&partnerID=8YFLogxK
U2 - 10.1109/SoCPaR.2009.54
DO - 10.1109/SoCPaR.2009.54
M3 - Conference contribution
AN - SCOPUS:77649280135
SN - 9780769538792
T3 - SoCPaR 2009 - Soft Computing and Pattern Recognition
SP - 229
EP - 233
BT - SoCPaR 2009 - Soft Computing and Pattern Recognition
Y2 - 4 December 2009 through 7 December 2009
ER -