18 search results - page 1 / 4 » GA-Selection Revisited from an ES-Driven Point of View |
IWINAC
2005
Springer
13 years 11 months ago
2005
Springer
Whereas the selection concept of Genetic Algorithms (GAs) and Genetic Programming (GP) is basically realized by the selection of above-average parents for reproduction, Evolution S...
EVOW
2010
Springer
14 years 14 days ago
2010
Springer
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
FOSSACS
2009
Springer
14 years 13 days ago
2009
Springer
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
CGF
2008
13 years 5 months ago
2008
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
EUROCAST
1997
Springer
13 years 9 months ago
1997
Springer
We show how to use recursive function theory to prove Turing universality of finite analog recurrent neural nets, with a piecewise linear sigmoid function as activation function. W...