Continuous Search in Constraint Programming - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Continuous Search in Constraint Programming


This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their problems. Continuous Search comes in two modes: the functioning mode solves the user's problem instances using the current heuristics model; the exploration mode reuses these instances to train and improve the heuristics model through Machine Learning during the computer idle time. Contrasting with previous approaches, Continuous Search thus does not require that the representative instances needed to train a good heuristics model be available beforehand. It achieves lifelong learning, gradually becoming an expert on the user's problem instance distribution. Experimental validation suggests that Continuous Search can design efficient mixed strategies after considering a moderate number of problem instances
Fichier principal
Vignette du fichier
dyn-cs-FinalVersion.pdf (350.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00515137 , version 1 (17-12-2010)


  • HAL Id : inria-00515137 , version 1


Alejandro Arbelaez, Youssef Hamadi, Michèle Sebag. Continuous Search in Constraint Programming. 22th International Conference on Tools with Artificial Intelligence, Oct 2010, Arras, France. ⟨inria-00515137⟩
238 View
525 Download


Gmail Facebook X LinkedIn More