1595 search results - page 57 / 319 » An Evolutionary Local Search Algorithm for the Satisfiabilit... |
122
Voted
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
This paper makes a number of connections between life and various facets of genetic and evolutionary algorithms research. Specifically, it addresses the topics of adaptation, mult...
116
click to vote
EVOW
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
120
click to vote
PVM
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
104
Voted
CPAIOR
2010
Springer
15 years 7 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...
125
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...