Sciweavers

238 search results - page 34 / 48
» gecco 2004
Sort
View
GECCO
2004
Springer
15 years 3 months ago
Shortcomings with Tree-Structured Edge Encodings for Neural Networks
In evolutionary algorithms a common method for encoding neural networks is to use a tree-structured assembly procedure for constructing them. Since node operators have difficulties...
Gregory Hornby
GECCO
2004
Springer
15 years 3 months ago
Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm
Genetic algorithms have been successfully applied to many difficult problems but there have been some disappointing results as well. In these cases the choice of the internal repre...
Eduardo Rodriguez-Tello, Jose Torres-Jimenez
GECCO
2004
Springer
147views Optimization» more  GECCO 2004»
15 years 3 months ago
A Demonstration of Neural Programming Applied to Non-Markovian Problems
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
Gabriel Catalin Balan, Sean Luke
GECCO
2004
Springer
110views Optimization» more  GECCO 2004»
15 years 3 months ago
Using GP to Model Contextual Human Behavior
To create a realistic environment, some simulations require simulated agents with human behavior pattern. Creating such agents with realistic behavior can be a tedious and time con...
Hans Fernlund, Avelino J. Gonzalez
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
15 years 3 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf