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.
Type de document :
Autre publication
Constraint Programming - Doctoral Program. 2009
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00435524
Contributeur : Alejandro Arbelaez <>
Soumis le : mardi 24 novembre 2009 - 12:24:01
Dernière modification le : mardi 24 novembre 2009 - 16:32:22
Document(s) archivé(s) le : jeudi 17 juin 2010 - 19:21:06

Fichier

CP-DP2009Arbelaez.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00435524, version 1

Collections

Citation

Alejandro Arbelaez, Youssef Hamadi. Continuous Search in Constraint Programming: An Initial Investigation. Constraint Programming - Doctoral Program. 2009. 〈inria-00435524〉

Partager

Métriques

Consultations de la notice

220

Téléchargements de fichiers

88