Extensible CP-based autonomous search

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations

Abstract

A main concern in Constraint Programming (CP) is to determine good variable and value order heuristics. However, this is known to be quite difficult as the effects on the solving process are rarely predictable. A novel solution to handle this concern is called Autonomous Search (AS), which is a special feature allowing an automatic reconfiguration of the solving process when a poor performance is detected. In this paper, we present a preliminary architecture for performing AS in CP. The idea is to perform an "on the fly" replacement of bad-performing heuristics by more promising ones. Another interesting feature of this architecture is its extensibility. It is possible to easily upgrade their components in order to improve the AS mechanism.

Original languageEnglish
Title of host publicationHCI International 2011 - Posters' Extended Abstracts - International Conference, HCI International 2011, Proceedings
Pages561-565
Number of pages5
EditionPART 1
DOIs
StatePublished - 21 Jul 2011
Event14th International Conference on Human-Computer Interaction, HCI International 2011 - Orlando, FL, United States
Duration: 9 Jul 201114 Jul 2011

Publication series

NameCommunications in Computer and Information Science
NumberPART 1
Volume173 CCIS
ISSN (Print)1865-0929

Conference

Conference14th International Conference on Human-Computer Interaction, HCI International 2011
CountryUnited States
CityOrlando, FL
Period9/07/1114/07/11

Keywords

  • Autonomous Search
  • Constraint Programming
  • Heuristic Search

Fingerprint Dive into the research topics of 'Extensible CP-based autonomous search'. Together they form a unique fingerprint.

Cite this