Sciweavers

GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
13 years 8 months ago
Generalized cycle crossover for graph partitioning
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
13 years 8 months ago
A hybrid genetic search for multiple sequence alignment
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...
Seung-Hyun Moon, Sung-Soon Choi, Byung Ro Moon
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
13 years 8 months ago
Genomic computing networks learn complex POMDPs
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...
David J. Montana, Eric Van Wyk, Marshall Brinn, Jo...
GECCO
2006
Springer
210views Optimization» more  GECCO 2006»
13 years 8 months ago
Adaptive diversity in PSO
Spatial Extension PSO (SEPSO) and Attractive-Repulsive PSO (ARPSO) are methods for artificial injection of diversity into particle swarm optimizers that are intended to encourage ...
Christopher K. Monson, Kevin D. Seppi
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
13 years 8 months ago
Towards effective adaptive random testing for higher-dimensional input domains
Adaptive Random Testing subsumes a class of algorithms that detect the first failure with less test cases than Random Testing. The present paper shows that a "reference metho...
Johannes Mayer
GECCO
2006
Springer
141views Optimization» more  GECCO 2006»
13 years 8 months ago
Coevolution of neural networks using a layered pareto archive
The Layered Pareto Coevolution Archive (LAPCA) was recently proposed as an effective Coevolutionary Memory (CM) which, under certain assumptions, approximates monotonic progress i...
German A. Monroy, Kenneth O. Stanley, Risto Miikku...
GECCO
2006
Springer
173views Optimization» more  GECCO 2006»
13 years 8 months ago
Ant colony optimization technique for equilibrium assignment in congested transportation networks
This paper deals with transport user equilibrium. A modified version of the ant colony system is proposed where the ant colony heuristic is adapted in order to take into account a...
Matteo Matteucci, Lorenzo Mussone
GECCO
2006
Springer
175views Optimization» more  GECCO 2006»
13 years 8 months ago
A computational theory of adaptive behavior based on an evolutionary reinforcement mechanism
Two mathematical and two computational theories from the field of human and animal learning are combined to produce a more general theory of adaptive behavior. The cornerstone of ...
J. J. McDowell, Paul L. Soto, Jesse Dallery, Saule...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
13 years 8 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius