Autonomous Search: Towards the Easy Tuning of Constraint Programming Solvers

Broderick Crawford, Ricardo Soto, Rodrigo Olivares, Rodrigo Herrera, Eric Monfroy, Fernando Paredes

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

1 Cita (Scopus)

Resumen

Constraint programming (CP) allows users to solve combinatorial problems by simply launching the corresponding model in a search engine. However, achieving good results may clearly depend on the correct search engine configuration, which demands advanced knowledge from the modeler. Recently, Autonomous Search (AS) appeared as a new technique that enables a given search engine to control and adapt its own configuration based on self-tuning. The goal is to be more efficient without the knowledge of an expert user. In this paper, we illustrate how the integration of AS into CP is carried out, reducing as a consequence the user involvement in solver tuning.

Idioma originalInglés
Título de la publicación alojadaHCI International 2014 - Posters' Extended Abstracts - International Conference, HCI International 2014, Proceedings
EditorialSpringer Verlag
Páginas165-168
Número de páginas4
ISBN (versión impresa)9783319078564
DOI
EstadoPublicada - 2014
Publicado de forma externa

Serie de la publicación

NombreCommunications in Computer and Information Science
Volumen434 PART I
ISSN (versión impresa)1865-0929

Huella

Profundice en los temas de investigación de 'Autonomous Search: Towards the Easy Tuning of Constraint Programming Solvers'. En conjunto forman una huella única.

Citar esto