SAC
2011
ACM
12 years 7 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
KES
2008
Springer
13 years 4 months ago
2008
Springer
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
GECCO
2000
Springer
13 years 8 months ago
2000
Springer
Traditional Genetic Algorithms (GA) use crossover and mutation as the main genetic operators to achieve population diversity. Previous work using a biologically inspired genetic o...
EUROGP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. To analyse various properties of the search process of genetic programming it is useful to quantify the distance between two individuals. Using operator-based distance me...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
A meta-GA (GA within a GA) is used to investigate evolving the parameter settings of genetic operators for genetic and evolutionary algorithms (GEA) in the hope of creating a self...