85 search results - page 1 / 17 » A Hybrid Approach to Distributed Constraint Satisfaction |
AIMSA
2008
Springer
13 years 6 months ago
2008
Springer
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
ACST
2006
13 years 5 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
GECCO
2003
Springer
13 years 9 months ago
2003
Springer
Estimation of Distribution Algorithms (EDAs) are new promising methods in the field of genetic and evolutionary algorithms. In the case of conventional Genetic and Evolutionary Al...
GECCO
2004
Springer
13 years 9 months ago
2004
Springer
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
FLAIRS
2004
13 years 5 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...