Show simple item record

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.1109/CISTI.2015.7170511
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6322
dc.descriptionIn constraint programming, efficiency in the resolution process can be affected by the order in which the variables of the problem and the domain values are selected. This activity is known as enumeration. At the beginning, it is difficult to determine the best choice variable-value pair that can generate potential solutions for constraint satisfaction problems. In this paper, we present an evaluation of different enumeration strategies, based on performance exhibited in a set indicators. These strategies solve different instances of constraint problems satisfactions. The results show that it is feasible to solve constraint satisfaction with at least one strategy enumeration. © 2015 AISTI.
dc.language.isoes
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectconstraint programming
dc.subjectconstraint satisfaction problems
dc.subjectenumeration strategies
dc.subjectheuristic
dc.subjectComputer programming
dc.subjectConstraint theory
dc.subjectInformation systems
dc.subjectProblem solving
dc.subjectBest choice
dc.subjectConstraint problems
dc.subjectConstraint programming
dc.subjectConstraint Satisfaction
dc.subjectenumeration strategies
dc.subjectheuristic
dc.subjectResolution process
dc.subjectConstraint satisfaction problems
dc.titleEnumeration strategies to solve constraint satisfaction problems: Performance evaluation [Estrategias de Enumeración para Resolver Problemas de Satisfacción de Restricciones: Evaluación de desempeño]
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record