Extensible CP-based autonomous search

Broderick Crawford, Ricardo Soto, Carlos Castro, Eric Monfroy

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

21 Citas (Scopus)

Resumen

A main concern in Constraint Programming (CP) is to determine good variable and value order heuristics. However, this is known to be quite difficult as the effects on the solving process are rarely predictable. A novel solution to handle this concern is called Autonomous Search (AS), which is a special feature allowing an automatic reconfiguration of the solving process when a poor performance is detected. In this paper, we present a preliminary architecture for performing AS in CP. The idea is to perform an "on the fly" replacement of bad-performing heuristics by more promising ones. Another interesting feature of this architecture is its extensibility. It is possible to easily upgrade their components in order to improve the AS mechanism.

Idioma originalInglés
Título de la publicación alojadaHCI International 2011 - Posters' Extended Abstracts - International Conference, HCI International 2011, Proceedings
Páginas561-565
Número de páginas5
EdiciónPART 1
DOI
EstadoPublicada - 2011
Publicado de forma externa
Evento14th International Conference on Human-Computer Interaction, HCI International 2011 - Orlando, FL, Estados Unidos
Duración: 9 jul 201114 jul 2011

Serie de la publicación

NombreCommunications in Computer and Information Science
NúmeroPART 1
Volumen173 CCIS
ISSN (versión impresa)1865-0929

Conferencia

Conferencia14th International Conference on Human-Computer Interaction, HCI International 2011
País/TerritorioEstados Unidos
CiudadOrlando, FL
Período9/07/1114/07/11

Huella

Profundice en los temas de investigación de 'Extensible CP-based autonomous search'. En conjunto forman una huella única.

Citar esto