14548 search results - page 2666 / 2910 » The Optimal Path-Matching Problem |
170
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
Cyclic genetic algorithms can be used to generate single loop control programs for robots. While successful in generating controllers for individual leg movement, gait generation,...
182
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
The paper presents an extension of Vose’s Markov chain model for genetic algorithm (GA). The model contains not only standard genetic operators such as mutation and crossover bu...
180
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
Tournament selection is the most frequently used form of selection in genetic programming (GP). Tournament selection chooses individuals uniformly at random from the population. A...
155
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
Genetic representations that do not employ a one-to-one mapping of genotype to phenotype are known as indirect encodings, and can be much more efficient than direct encodings for ...
221
click to vote
GECCO
2005
Springer
16 years 3 days ago
2005
Springer
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...