717 search results - page 1 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
AAAI
1994
13 years 8 months ago
1994
TEC
2002
13 years 7 months ago
2002
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
ECAIW
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we present a tabu approach for a version of the Sports League Scheduling Problem. The approach adopted is based on a formulation of the problem as a Constraint Satisf...
CP
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...
SAGA
2001
Springer
13 years 12 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...