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

Broderick Crawford, Mauricio Montecinos, Carlos Castro, Eric Monfroy

Producción científica: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

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.

Idioma originalInglés
Título de la publicación alojadaSoCPaR 2009 - Soft Computing and Pattern Recognition
Páginas229-233
Número de páginas5
DOI
EstadoPublicada - 2009
EventoInternational Conference on Soft Computing and Pattern Recognition, SoCPaR 2009 - Malacca, Malasia
Duración: 4 dic. 20097 dic. 2009

Serie de la publicación

NombreSoCPaR 2009 - Soft Computing and Pattern Recognition

Conferencia

ConferenciaInternational Conference on Soft Computing and Pattern Recognition, SoCPaR 2009
País/TerritorioMalasia
CiudadMalacca
Período4/12/097/12/09

Huella

Profundice en los temas de investigación de 'A choice function to dynamic selection of enumeration strategies solving constraint satisfaction problems'. En conjunto forman una huella única.

Citar esto