1264 search results - page 127 / 253 » The framework approach for constraint satisfaction |
152
click to vote
CEC
2007
IEEE
15 years 10 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...
160
click to vote
CP
1995
Springer
15 years 10 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...
185
click to vote
IJCAI
2003
15 years 7 months ago
2003
In [Jegou, 1993], a decomposition method has been introduced for improving search efficiency in the area of Constraint Satisfaction Problems. This method is based on properties of...
152
click to vote
AAAI
1997
15 years 7 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
178
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
Current search engines can hardly cope adequately with fuzzy predicates defined by complex preferences. The biggest problem of search engines implemented with standard SQL is that...