167 search results - page 1 / 34 » A Genetic Local Search Algorithm for Random Binary Constrain... |
SAC
2000
ACM
13 years 8 months ago
2000
ACM
TEC
2002
13 years 4 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...
TIME
2002
IEEE
13 years 9 months ago
2002
IEEE
Local search techniques have attracted considerable interest in the Artificial Intelligence (AI) community since the development of GSAT [9] and the min-conflicts heuristic [5] ...
CSR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
AAAI
1997
13 years 6 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...