Sciweavers

627 search results - page 11 / 126
» How optimal is the genetic code
Sort
View
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
14 years 4 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
14 years 5 months ago
A doubly distributed genetic algorithm for network coding
We present a genetic algorithm which is distributed in two novel ways: along genotype and temporal axes. Our algorithm first distributes, for every member of the population, a su...
Minkyu Kim, Varun Aggarwal, Una-May O'Reilly, Muri...
ICCBR
2005
Springer
14 years 4 months ago
Combining Case-Based Memory with Genetic Algorithm Search for Competent Game AI
We use case-injected genetic algorithms for learning how to competently play computer strategy games. Case-injected genetic algorithms combine genetic algorithm search with a case-...
Sushil J. Louis, Chris Miles
GECCO
2000
Springer
142views Optimization» more  GECCO 2000»
14 years 2 months ago
Controlling Effective Introns for Multi-Agent Learning by Genetic Programming
This paper presents the emergence of the cooperative behavior for multiple agents by means of Genetic Programming (GP). For the purpose of evolving the effective cooperative behav...
Hitoshi Iba, Makoto Terao
GECCO
2004
Springer
14 years 4 months ago
How Are We Doing? Predicting Evolutionary Algorithm Performance
Abstract. Given an evolutionary algorithm for a problem and an instance of the problem, the results of several trials of the EA on the instance constitute a sample from the distrib...
Mark A. Renslow, Brenda Hinkemeyer, Bryant A. Juls...