Continuous Search in Constraint Programming: An Initial Investigation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Other Publications Year : 2009

Continuous Search in Constraint Programming: An Initial Investigation

Alejandro Arbelaez
  • Function : Author
  • PersonId : 856329
Youssef Hamadi
  • Function : Author
  • PersonId : 840368

Abstract

In this work, we present the concept of Continuous Search (CS), which objective is to allow any user to eventually get top performance from their constraint solver. Unlike previous approaches, Continuous Search does not require the disposal of a large set of representative instances to properly train and learn parameters. It only assumes that once the solver runs in a real situation (often called production mode), instances will come over time, and allow for proper offline continuous training. The objective is therefore not to instantly provide good parameters for top performance, but to take advantage of the real situation to train in the background and improve the performances of the system in an incremental manner.
Fichier principal
Vignette du fichier
CP-DP2009Arbelaez.pdf (226.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00435524 , version 1 (24-11-2009)

Identifiers

  • HAL Id : inria-00435524 , version 1

Cite

Alejandro Arbelaez, Youssef Hamadi. Continuous Search in Constraint Programming: An Initial Investigation. 2009. ⟨inria-00435524⟩

Collections

INRIA
123 View
129 Download

Share

Gmail Facebook X LinkedIn More