Enumeration 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]
Autor
Soto R.
Crawford B.
Olivares R.
Herrera R.
Johnson F.
Paredes F.
Resumen
In 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.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
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] (2020)
Soto R.; Crawford B.; Olivares R.; Olguin E. (IEEE Computer Society, 2016) -
Conference Paper
Enumeration strategies for solving constraint satisfaction problems: A performance evaluation (2020)
Soto R.; Crawford B.; Olivares R.; Herrera R.; Johnson F.; Paredes F. (Springer Verlag, 2015) -
Conference Paper
Online control of enumeration strategies via bat-inspired optimization (2020)
Soto R.; Crawford B.; Olivares R.; Johnson F.; Paredes F. (Springer Verlag, 2015)