1051 search results - page 175 / 211 » Foundations of Constraint Satisfaction |
CEC
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper studies the problems involved in solving, rating and generating Sudoku puzzles with genetic algorithms (GA). Sudoku is a number puzzle that has recently become a worldwi...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
Polymer microstructured optical fibres are a relatively recent development in optical fibre technology, supporting a wide variety of microstructure fibre geometries, when compared...
CP
2004
Springer
14 years 1 months ago
2004
Springer
A distributed concurrent search algorithm for distributed constraint satisfaction problems (DisCSPs) is presented. Concurrent search algorithms are composed of multiple search proc...
CP
2006
Springer
14 years 1 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
CP
1995
Springer
14 years 1 months ago
1995
Springer
The forward checking algorithm for solving constraint satisfaction problems is a popular and successful alternative to backtracking. However, its successhas largely been determined...