Online Heuristic Selection in Constraint Programming - Archive ouverte HAL Access content directly
Other Publications Year : 2009

Online Heuristic Selection in Constraint Programming

(1) , (2) , (1)
1
2
Alejandro Arbelaez
  • Function : Author
  • PersonId : 856329
Youssef Hamadi
  • Function : Author
  • PersonId : 840368
Michèle Sebag
  • Function : Author
  • PersonId : 836537

Abstract

This paper presents our first attempt to apply Support Vector Machines to the problem of automatically tuning CP search algorithms. More precisely, we exploit instances features to dynamically adapt the search strategy of a CP solver in order to more efficiently solve a given instance. In these preliminary results, adaptation is restricted to restart points, and the number of times the strategy changes is also restricted. We report very encouraging results where our adaptation outperforms what is currently considered as one of the state of the art dynamic variable selection strategy.
Fichier principal
Vignette du fichier
search-socs.pdf (161.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00392752 , version 1 (08-06-2009)

Identifiers

  • HAL Id : inria-00392752 , version 1

Cite

Alejandro Arbelaez, Youssef Hamadi, Michèle Sebag. Online Heuristic Selection in Constraint Programming. 2009. ⟨inria-00392752⟩

Collections

INRIA
330 View
491 Download

Share

Gmail Facebook Twitter LinkedIn More