Mostrar el registro sencillo del ítem

The impact of using different choice functions when solving CSPs with autonomous search

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorOlivares R.
dc.contributor.authorNiklander S.
dc.contributor.authorOlguín E.
dc.date.accessioned2020-09-02T22:28:44Z
dc.date.available2020-09-02T22:28:44Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-42007-3_77
dc.identifier.citation9799, , 904-916
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6327
dc.descriptionConstraint programming is a powerful technology for the efficient solving of optimization and constraint satisfaction problems (CSPs). 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. However, choice functions can be constructed in several manners variating the information used to take decisions. Such variations may certainly conduct to very different resolution processes. In this paper, we study the impact on the solving phase of 16 different carefully constructed 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. © Springer International Publishing Switzerland 2016.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceAli M.Fujita H.Sasaki J.Kurematsu M.Selamat A.
dc.subjectAutonomous search
dc.subjectChoice functions
dc.subjectConstraint programming
dc.subjectConstraint satisfaction
dc.subjectOptimization
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectIntelligent systems
dc.subjectKnowledge based systems
dc.subjectOptimization
dc.subjectAutonomous searches
dc.subjectChoice function
dc.subjectConstraint programming
dc.subjectConstraint Satisfaction
dc.subjectDifferent resolutions
dc.subjectImprove performance
dc.subjectProblem resolution
dc.subjectConstraint satisfaction problems
dc.titleThe impact of using different choice functions when solving CSPs with autonomous search
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem