Mostrar el registro sencillo del ítem

Evaluating the efficient of using choice functions to solve CSPs via Autonomous Search [Evaluando La Eficiencia De Utilizar Funciones De Selección En Búsqueda Autónoma Para Resolver Problemas De Satisfacción De Restricciones]

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorOlivares R.
dc.contributor.authorOlguin E.
dc.date.accessioned2020-09-02T22:28:44Z
dc.date.available2020-09-02T22:28:44Z
dc.date.issued2016
dc.identifier10.1109/CISTI.2016.7521571
dc.identifier.citation2016-July, , -
dc.identifier.issn21660727
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6328
dc.descriptionConstraint programming is a powerful paradigm that allows for solving optimization and constraint satisfaction problems (CSPs). In this context, a main concern of this technology is that the efficient problem resolution usually relies on the employed solving strategy. Unfortunately, selecting the proper one is known to be complex as the behavior of strategies is commonly unpredictable. Recently, Autonomous Search appeared as a new technique to tackle this concern. The idea is to let the solver adapt its strategy during solving time in order to improve performance. This task is controlled by a choice function which decides, based on performance information, how the strategy must be updated. In this paper, we evaluate the impact on the solving phase of 16 different choice functions. We employ as test bed a set of well-known benchmarks that collect general features present on most CSPs. Interesting experimental results are obtained in order to provide the best-performing choice functions for solving CSPs. © 2016 AISTI.
dc.language.isoes
dc.publisherIEEE Computer Society
dc.sourceRocha A.Reis L.P.Cota M.P.Goncalves R.Suarez O.S.
dc.subjectautonomous search
dc.subjectchoice function
dc.subjectConstraint programming
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectFunction evaluation
dc.subjectInformation systems
dc.subjectAutonomous searches
dc.subjectChoice function
dc.subjectConstraint programming
dc.subjectImprove performance
dc.subjectProblem resolution
dc.subjectConstraint satisfaction problems
dc.titleEvaluating the efficient of using choice functions to solve CSPs via Autonomous Search [Evaluando La Eficiencia De Utilizar Funciones De Selección En Búsqueda Autónoma Para Resolver Problemas De Satisfacción De Restricciones]
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem