Sciweavers

2174 search results - page 200 / 435
» On the Brittleness of Evolutionary Algorithms
Sort
View
GECCO
2010
Springer
140views Optimization» more  GECCO 2010»
15 years 6 months ago
Shared memory genetic algorithms in a multi-agent context
In this paper we present a concurrent implementation of genetic algorithms designed for shared memory architectures intended to take advantage of multi-core processor platforms. O...
Dana Vrajitoru
CEC
2009
IEEE
16 years 1 months ago
The Differential Ant-Stigmergy Algorithm applied to dynamic optimization problems
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
Peter Korosec, Jurij Silc
EC
2006
153views ECommerce» more  EC 2006»
15 years 6 months ago
GASAT: A Genetic Local Search Algorithm for the Satisfiability Problem
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossov...
Frédéric Lardeux, Frédé...
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
15 years 12 months ago
Modeling Coevolutionary Genetic Algorithms on Two-Bit Landscapes: Random Partnering
Abstract. A model of coevolutioinary genetic algorithms (COGA) consisting of two populations coevolving on two-bit landscapes is investigated in terms of the effects of random par...
Ming Chang, Kazuhiro Ohkura, Kanji Ueda, Masaharu ...
EVOW
2006
Springer
15 years 10 months ago
A Multiagent Algorithm for Graph Partitioning
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
Francesc Comellas, Emili Sapena