A choice function to dynamic selection of enumeration strategies solving constraint satisfaction problems

BRODERICK CRAWFORD LABRIN, Mauricio Montecinos, Carlos Castro, Eric Monfroy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationSoCPaR 2009 - Soft Computing and Pattern Recognition
Pages229-233
Number of pages5
DOIs
StatePublished - 1 Dec 2009
EventInternational Conference on Soft Computing and Pattern Recognition, SoCPaR 2009 - Malacca, Malaysia
Duration: 4 Dec 20097 Dec 2009

Publication series

NameSoCPaR 2009 - Soft Computing and Pattern Recognition

Conference

ConferenceInternational Conference on Soft Computing and Pattern Recognition, SoCPaR 2009
CountryMalaysia
CityMalacca
Period4/12/097/12/09

Keywords

  • Constraint programming
  • Enumeration strategies
  • Value ordering heuristics
  • Variable ordering heuristics

Fingerprint Dive into the research topics of 'A choice function to dynamic selection of enumeration strategies solving constraint satisfaction problems'. Together they form a unique fingerprint.

Cite this