721 search results - page 132 / 145 » GRASP - evolution for constraint satisfaction problems |
67
Voted
CEC
2007
IEEE
15 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...
74
Voted
AAAI
1996
14 years 11 months ago
1996
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
71
Voted
JAIR
2008
14 years 9 months ago
2008
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
ICCAD
2004
IEEE
15 years 6 months ago
2004
IEEE
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we model each task ...