Continuous Search in Constraint Programming: An Initial Investigation

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.
Document type :
Other publications
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00435524
Contributor : Alejandro Arbelaez <>
Submitted on : Tuesday, November 24, 2009 - 12:24:01 PM
Last modification on : Tuesday, November 24, 2009 - 4:32:22 PM
Long-term archiving on: Thursday, June 17, 2010 - 7:21:06 PM

File

CP-DP2009Arbelaez.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00435524, version 1

Collections

Citation

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

Share

Metrics

Record views

247

Files downloads

98