Local search as a fixed point of functions

Eric Monfroy, Frédéric Saubion, BRODERICK CRAWFORD LABRIN, Carlos Castro

Resultado de la investigación: Capítulo del libro/informe/acta de congresoContribución a la conferenciarevisión exhaustiva

Resumen

Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, ...). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.

Idioma originalInglés
Título de la publicación alojadaICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems
Páginas431-434
Número de páginas4
EstadoPublicada - 1 dic 2008
EventoICEIS 2008 - 10th International Conference on Enterprise Information Systems - Barcelona, Espana
Duración: 12 jun 200816 jun 2008

Serie de la publicación

NombreICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems
VolumenAIDSS

Conferencia

ConferenciaICEIS 2008 - 10th International Conference on Enterprise Information Systems
País/TerritorioEspana
CiudadBarcelona
Período12/06/0816/06/08

Huella

Profundice en los temas de investigación de 'Local search as a fixed point of functions'. En conjunto forman una huella única.

Citar esto