Sciweavers

330 search results - page 44 / 66
» Diagnosing and Solving Over-Determined Constraint Satisfacti...
Sort
View
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 8 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang
CEC
2007
IEEE
14 years 1 days 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
IJCNN
2006
IEEE
14 years 2 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
Shengxiang Yang
ICTAI
2007
IEEE
14 years 2 months ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek
CP
2008
Springer
13 years 9 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang