711 search results - page 130 / 143 » Amalgams of Constraint Satisfaction Problems |
85
Voted
SETN
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In order to obtain a solution to a constraint satisfaction problem, constructive methods iteratively extend a consistent partial assignment until all problem variables ar...
104
click to vote
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorit...
CEC
2007
IEEE
15 years 3 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...
ICASSP
2008
IEEE
15 years 6 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...
JAIR
2008
14 years 11 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 ...