167 search results - page 3 / 34 » A Genetic Local Search Algorithm for Random Binary Constrain... |
135
click to vote
EVOW
2008
Springer
15 years 4 months ago
2008
Springer
This paper introduces a hybrid Tabu Search - Evolutionary Algorithm for solving the binary constraint satisfaction problem, called CTLEA. A continuation of an earlier introduced al...
100
Voted
GECCO
2004
Springer
15 years 8 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...
107
Voted
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
132
Voted
AMAI
1999
Springer
15 years 2 months ago
1999
Springer
The paper focuses on evaluating constraint satisfaction search algorithms on application based random problem instances. The application we use is a well-studied problem in the el...
107
Voted
AAAI
1994
15 years 4 months ago
1994
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...