Sciweavers

1830 search results - page 38 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
EUROGP
2003
Springer
259views Optimization» more  EUROGP 2003»
15 years 11 months ago
Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms
This paper presents a method of using genetic programming to seek new cellular automata that perform computational tasks. Two genetic algorithms are used : the first one discovers ...
Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Cha...
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
15 years 9 months ago
Spectral techniques for graph bisection in genetic algorithms
Various applications of spectral techniques for enhancing graph bisection in genetic algorithms are investigated. Several enhancements to a genetic algorithm for graph bisection a...
Jacob G. Martin
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
15 years 10 months ago
Evolution, development and learning using self-modifying cartesian genetic programming
Self-Modifying Cartesian Genetic Programming (SMCGP) is a form of genetic programming that integrates developmental (self-modifying) features as a genotype-phenotype mapping. This...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
ICCS
2007
Springer
16 years 1 days ago
Genetic Algorithmic Topology Control for Two-Tiered Wireless Sensor Networks
This paper proposes an optimized topology control scheme
Donghwan Lee, Wonjun Lee, Joongheon Kim
FOCS
1990
IEEE
15 years 10 months ago
Uniform Memory Hierarchies
We present several e cient algorithms for sorting on the uniform memory hierarchy UMH, introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and ne...
Bowen Alpern, Larry Carter, Ephraim Feig