Sciweavers

879 search results - page 58 / 176
» Optimizing for Reduced Code Space using Genetic Algorithms
Sort
View
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 8 months ago
Dormant program nodes and the efficiency of genetic programming
In genetic programming, there is a tendency for individuals in a population to accumulate fragments of code – often called introns – which are redundant in the fitness evaluat...
David Jackson
ECCV
2004
Springer
16 years 4 months ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
UPP
2004
Springer
15 years 7 months ago
Inverse Design of Cellular Automata by Genetic Algorithms: An Unconventional Programming Paradigm
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
Thomas Bäck, Ron Breukelaar, Lars Willmes
115
Voted
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 7 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
109
Voted
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 8 months ago
Evolving problem heuristics with on-line ACGP
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
Cezary Z. Janikow