Sciweavers

627 search results - page 25 / 126
» How optimal is the genetic code
Sort
View
94
Voted
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
15 years 6 months ago
Behavior of finite population variable length genetic algorithms under random selection
In this work we provide empirical evidence that shows how a variable-length genetic algorithm (GA) can naturally evolve shorter average size populations. This reduction in chromos...
Hal Stringer, Annie S. Wu
GECCO
2008
Springer
278views Optimization» more  GECCO 2008»
15 years 1 months ago
Elitism reduces bloat in genetic programming
Elitism is commonly used in generational GP to ensure that the best individuals discovered in a generation are not lost, and are made available for possible further improvements t...
Riccardo Poli, Nicholas Freitag McPhee, Leonardo V...
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
15 years 6 months ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens
116
Voted
CODES
2004
IEEE
15 years 4 months ago
Power-aware communication optimization for networks-on-chips with voltage scalable links
Networks-on-Chip (NoC) is emerging as a practical development platform for future systems-on-chip products. We propose an energyefficient static algorithm which optimizes the ener...
Dongkun Shin, Jihong Kim
118
Voted
ASPDAC
2001
ACM
137views Hardware» more  ASPDAC 2001»
15 years 4 months ago
Optimized address assignment for DSPs with SIMD memory accesses
This paper deals with address assignment in code generation for digital signal processors (DSPs) with SIMD (single instruction multiple data) memory accesses. In these processors ...
Markus Lorenz, David Koffmann, Steven Bashford, Ra...