-=[ Docs ]=-

Maintien de solution dans les problemes dynamiques de satisfaction de contraintes: bilan de quelques approches - (>= 1994) Authors Gerard Verfaillie, Thomas Schiex Language Francais Type public Url Summary CSP, repair, local changes, conflict directed backjumping, nogood recording, dynamic backtracking, backtrack, problemes dynamiques Pages 41 Parts

A Glimpse of Constraint Satisfaction - (1999) Authors Edward Tsang Language English Type public Url Summary Constraint satisfaction, forward jumping, backtracking, 8-queens problem, repair strategies Pages 14 Parts

Constraint Satisfaction - (2001) Authors Manuela Veloso Language English Type public Url Summary CSP definition, examples, search improvements, satisfiable knowledge base, forward search, DPLL algorithm, hill climbing, simulated annealing, genetic evolution Pages 31 Parts

Forward Checking with Backmarking - (June 1993) Authors Patrick Prosser Language English Type public Url Summary CSP, Algorithm that combines forward checking with backmarking and conflict-directed backjumping to give FC-BM-CBJ Pages 14 Parts

On The Forward Checking Algorithm - (>= 1994) Authors Fahiem Bacchus, Adam Grove Language English Type public Url Summary CSP, forward checking, backtracking, minimal forward checking Pages 16 Parts

Constraint Satisfaction Problems and Evolutionary Computation: A Reality Check - (>= 1998) Authors J.I. van Hemert Language English Type public Url Summary Constraint satisfaction has been the subject of many studies. Different areas of research have tried to solve all kind of constraint problems. Here we will look at a general model for constraint satisfaction problems in the form of binary constraint satisfaction. The problems generated from this model are studied in the research area of constraint programming and in the research area of evolutionary computation. This paper provides an empirical comparison of two techniques from each area. Basically, this is a check on how well both areas are doing. It turns out that, although evolutionary algorithms are doing well, classic approaches are still more successful. Pages 8 Parts