Mostrar el registro sencillo del ítem

An extensible autonomous search framework for constraint programming

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorCastro C.
dc.contributor.authorMonfroy E.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:36Z
dc.date.available2020-09-02T22:15:36Z
dc.date.issued2011
dc.identifier.citation6, 14, 3369-3376
dc.identifier.issn19921950
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4125
dc.descriptionConstraint programming is a modern programming paradigm devoted to solve constraint-based problems, in particular combinatorial problems. In this paradigm, the efficiency on the solving process is the key, which generally depends on the selection of suitable search strategies. However, determining a good search strategy is quite difficult, as its effects on the solving process are hard to predict. A novel solution to handle this concern is called autonomous search, which is a special feature allowing an automatic reconfiguration of the solving process when a poor performance is detected. In this paper, we present an extensible architecture for performing autonomous search in a constraint programming context. The idea is to carry out an "on the fly" replacement of bad-performing strategies by more promising ones. We report encouraging results where the use of autonomous search in the resolution outperforms the use of individual strategies. © 2011 Academic Journals.
dc.language.isoen
dc.publisherAcademic Journals
dc.subjectAutonomous search
dc.subjectConstraint programming
dc.subjectHeuristic search
dc.titleAn extensible autonomous search framework for constraint programming
dc.typeArticle


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-80051709374.pdf
Tamaño:
2.001Kb
Formato:
PDF
Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem