Extensible CP-based autonomous search

BRODERICK   CRAWFORD LABRIN; RICARDO JAVIER SOTO DE GIORGIS; Carlos Castro; Eric Monfroy

doi:10.1007/978-3-642-22098-2_112

Extensible CP-based autonomous search

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Carlos Castro, Eric Monfroy

SCHOOL OF COMPUTER ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	HCI International 2011 - Posters' Extended Abstracts - International Conference, HCI International 2011, Proceedings
Pages	561-565
Number of pages	5
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-22098-2_112
State	Published - 21 Jul 2011
Event	14th International Conference on Human-Computer Interaction, HCI International 2011 - Orlando, FL, United States Duration: 9 Jul 2011 → 14 Jul 2011

Publication series

Name	Communications in Computer and Information Science
Number	PART 1
Volume	173 CCIS
ISSN (Print)	1865-0929

Conference

Conference	14th International Conference on Human-Computer Interaction, HCI International 2011
Country	United States
City	Orlando, FL
Period	9/07/11 → 14/07/11

Keywords

Autonomous Search
Constraint Programming
Heuristic Search

Access to Document

10.1007/978-3-642-22098-2_112

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

Cite this

CRAWFORD LABRIN, BRODERICK., SOTO DE GIORGIS, RICARDO. JAVIER., Castro, C., & Monfroy, E. (2011). Extensible CP-based autonomous search. In HCI International 2011 - Posters' Extended Abstracts - International Conference, HCI International 2011, Proceedings (PART 1 ed., pp. 561-565). (Communications in Computer and Information Science; Vol. 173 CCIS, No. PART 1). https://doi.org/10.1007/978-3-642-22098-2_112

@inproceedings{317e529b5a674fd7b71eff60949835cc,

title = "Extensible CP-based autonomous search",

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.",

keywords = "Autonomous Search, Constraint Programming, Heuristic Search",

author = "{CRAWFORD LABRIN}, BRODERICK and {SOTO DE GIORGIS}, {RICARDO JAVIER} and Carlos Castro and Eric Monfroy",

year = "2011",

month = jul,

day = "21",

doi = "10.1007/978-3-642-22098-2_112",

language = "English",

isbn = "9783642220975",

series = "Communications in Computer and Information Science",

number = "PART 1",

pages = "561--565",

booktitle = "HCI International 2011 - Posters' Extended Abstracts - International Conference, HCI International 2011, Proceedings",

edition = "PART 1",

note = "null ; Conference date: 09-07-2011 Through 14-07-2011",

}

CRAWFORD LABRIN, BRODERICK , SOTO DE GIORGIS, RICARDOJAVIER, Castro, C & Monfroy, E 2011, Extensible CP-based autonomous search. in HCI International 2011 - Posters' Extended Abstracts - International Conference, HCI International 2011, Proceedings. PART 1 edn, Communications in Computer and Information Science, no. PART 1, vol. 173 CCIS, pp. 561-565, 14th International Conference on Human-Computer Interaction, HCI International 2011, Orlando, FL, United States, 9/07/11. https://doi.org/10.1007/978-3-642-22098-2_112

Extensible CP-based autonomous search. / CRAWFORD LABRIN, BRODERICK ; SOTO DE GIORGIS, RICARDO JAVIER; Castro, Carlos; Monfroy, Eric.

HCI International 2011 - Posters' Extended Abstracts - International Conference, HCI International 2011, Proceedings. PART 1. ed. 2011. p. 561-565 (Communications in Computer and Information Science; Vol. 173 CCIS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Extensible CP-based autonomous search

AU - CRAWFORD LABRIN, BRODERICK

AU - SOTO DE GIORGIS, RICARDO JAVIER

AU - Castro, Carlos

AU - Monfroy, Eric

PY - 2011/7/21

Y1 - 2011/7/21

N2 - 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.

AB - 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.

KW - Autonomous Search

KW - Constraint Programming

KW - Heuristic Search

UR - http://www.scopus.com/inward/record.url?scp=79960392760&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-22098-2_112

DO - 10.1007/978-3-642-22098-2_112

M3 - Conference contribution

AN - SCOPUS:79960392760

SN - 9783642220975

T3 - Communications in Computer and Information Science

SP - 561

EP - 565

BT - HCI International 2011 - Posters' Extended Abstracts - International Conference, HCI International 2011, Proceedings

Y2 - 9 July 2011 through 14 July 2011

ER -

CRAWFORD LABRIN BRODERICK , SOTO DE GIORGIS RICARDOJAVIER, Castro C, Monfroy E. Extensible CP-based autonomous search. In HCI International 2011 - Posters' Extended Abstracts - International Conference, HCI International 2011, Proceedings. PART 1 ed. 2011. p. 561-565. (Communications in Computer and Information Science; PART 1). https://doi.org/10.1007/978-3-642-22098-2_112

Extensible CP-based autonomous search

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this