Sciweavers

714 search results - page 130 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
SETN
2004
Springer
14 years 3 months ago
Construction and Repair: A Hybrid Approach to Search in CSPs
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...
Konstantinos Chatzikokolakis, George Boukeas, Pana...
ECAI
2000
Springer
14 years 2 months ago
Activity Recognition from Video Sequences using Declarative Models
Abstract. We propose here a new approach for video sequence interpretation based on declarative models of activities. The aim of the video sequence interpretation is to recognize i...
Nathanaël Rota, Monique Thonnat
ICCAD
1999
IEEE
84views Hardware» more  ICCAD 1999»
14 years 2 months ago
OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic
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...
Robert M. Fuhrer, Steven M. Nowick
CEC
2007
IEEE
14 years 1 months ago
Solving, rating and generating Sudoku puzzles with GA
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...
Timo Mantere, Janne Koljonen
AAAI
1996
13 years 11 months ago
Neighborhood Inverse Consistency Preprocessing
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...
Eugene C. Freuder, Charles D. Elfe