Sciweavers

3120 search results - page 313 / 624
» A parameter-less genetic algorithm
Sort
View
ECAL
2007
Springer
15 years 11 months ago
Genotype Editing and the Evolution of Regulation and Memory
Our agent-based model of genotype editing is defined by two distinct genetic components: a coding portion encoding phenotypic solutions, and a non-coding portion used to edit the ...
Luis Mateus Rocha, Jasleen Kaur
GECCO
2007
Springer
195views Optimization» more  GECCO 2007»
15 years 8 months ago
Diverse committees vote for dependable profits
Stock selection for hedge fund portfolios is a challenging problem for Genetic Programming (GP) because the markets (the environment in which the GP solution must survive) are dyn...
Wei Yan, Christopher D. Clack
ECAI
2010
Springer
15 years 6 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave
DIGRA
2005
Springer
15 years 10 months ago
Realistic Agent Movement in Dynamic Game Environments
One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are usually employed as the core...
Ross Graham, Hugh McCabe, Stephen Sheridan
GECCO
2005
Springer
196views Optimization» more  GECCO 2005»
15 years 10 months ago
Breeding swarms: a new approach to recurrent neural network training
This paper shows that a novel hybrid algorithm, Breeding Swarms, performs equal to, or better than, Genetic Algorithms and Particle Swarm Optimizers when training recurrent neural...
Matthew Settles, Paul Nathan, Terence Soule