Sciweavers

850 search results - page 28 / 170
» On Genetic Algorithms and Lindenmayer Systems
Sort
View
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 8 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
GECCO
2006
Springer
171views Optimization» more  GECCO 2006»
15 years 5 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
LCTRTS
1999
Springer
15 years 6 months ago
Optimizing for Reduced Code Space using Genetic Algorithms
Code space is a critical issue facing designers of software for embedded systems. Many traditional compiler optimizations are designed to reduce the execution time of compiled cod...
Keith D. Cooper, Philip J. Schielke, Devika Subram...
91
Voted
APIN
2005
87views more  APIN 2005»
15 years 1 months ago
Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms
In the direct solution of sparse symmetric and positive definite linear systems, finding an ordering of the matrix to minimize the height 1
Wen-Yang Lin
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 7 months ago
EA models and population fixed-points versus mutation rates for functions of unitation
Using a dynamic systems model for the Simple Genetic Algorithm due to Vose[1], we analyze the fixed point behavior of the model without crossover applied to functions of unitation...
J. Neal Richter, John Paxton, Alden H. Wright