Mostrar el registro sencillo del ítem

Enumeration strategies for solving constraint satisfaction problems: A performance evaluation

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorOlivares R.
dc.contributor.authorHerrera R.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:28:43Z
dc.date.available2020-09-02T22:28:43Z
dc.date.issued2015
dc.identifier10.1007/978-3-319-18476-0_18
dc.identifier.citation347, , 169-179
dc.identifier.issn21945357
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6321
dc.descriptionConstraint programming allows to solve constraint satisfaction and optimization problems by building and then exploring a search tree of potential solutions. Potential solutions are generated by firstly selecting a variable and then a value from the given problem. The enumeration strategy is responsible for selecting the order in which those variables and values are selected to produce a potential solution. There exist different ways to perform this selection, and depending on the quality of this decision, the efficiency of the solving process may dramatically vary. A main concern in this context is that the behavior of the strategy is notably hard to predict. In this paper, we present a performance evaluation of 24 enumeration strategies for solving constraint satisfaction problems. Our goal is to provide new and interesting knowledge about the behavior of such strategies. To this end, we employ a set of wellknown benchmarks that collect general features that may be present on most constraint satisfaction and optimization problems. We believe this information will be useful to help users making better solving decisions when facing new problems. © Springer International Publishing Switzerland 2015.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceSilhavy R.Senkerik R.Oplatkova Z.K.Prokopova Z.Silhavy P.
dc.subjectConstraint programming
dc.subjectConstraint satisfaction problems
dc.subjectEnumeration strategies
dc.subjectHeuristics
dc.subjectArtificial intelligence
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectOptimization
dc.subjectProblem solving
dc.subjectSocial networking (online)
dc.subjectConstraint programming
dc.subjectConstraint Satisfaction
dc.subjectEnumeration strategies
dc.subjectHeuristics
dc.subjectOptimization problems
dc.subjectSearch trees
dc.subjectConstraint satisfaction problems
dc.titleEnumeration strategies for solving constraint satisfaction problems: A performance evaluation
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem