Sciweavers

452 search results - page 20 / 91
» Evolutionary tree genetic programming
Sort
View
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
14 years 1 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom
GECCO
2010
Springer
338views Optimization» more  GECCO 2010»
13 years 7 months ago
Multiobjective evolutionary community detection for dynamic networks
A multiobjective genetic algorithm for detecting communities in dynamic networks, i.e., networks that evolve over time, is proposed. The approach leverages on the concept of evolu...
Francesco Folino, Clara Pizzuti
AIIA
1995
Springer
14 years 17 hour ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung
UC
2005
Springer
14 years 1 months ago
Using Genetic Algorithms to Evolve Behavior in Cellular Automata
Abstract. It is an unconventional computation approach to evolve solutions instead of calculating them. Although using evolutionary computation in computer science dates back to th...
Thomas Bäck, Ron Breukelaar
GECCO
2003
Springer
14 years 1 months ago
Visualizing Tree Structures in Genetic Programming
This paper presents methods to visualize the structure of trees that occur in genetic programming. These methods allow for the inspection of structure of entire trees of arbitrary ...
Jason M. Daida, Adam M. Hilss, David J. Ward, Step...