419 search results - page 15 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
CP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
CONSTRAINTS
2010
13 years 8 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
CP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract Competition and cooperation can boost the performance of a combinatorial search process. Both can be implemented with a portfolio of algorithms which run in parallel, give...
ECAI
1994
Springer
14 years 16 days ago
1994
Springer
We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations s...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
—Constraint satisfaction problems (CSPs) widely occur in artificial intelligence. In the last twenty years, many algorithms and heuristics were developed to solve CSP. Recently,...