Sciweavers

1725 search results - page 45 / 345
» Relaxed genetic programming
Sort
View
ISPD
2000
ACM
113views Hardware» more  ISPD 2000»
14 years 3 months ago
Floorplan area minimization using Lagrangian relaxation
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
Fung Yu Young, Chris C. N. Chu, W. S. Luk, Y. C. W...
EH
2004
IEEE
107views Hardware» more  EH 2004»
14 years 2 months ago
Evolving Digital Circuits using Multi Expression Programming
Multi Expression Programming (MEP) is a Genetic Programming (GP) variant that uses linear chromosomes for solution encoding. A unique MEP feature is its ability of encoding multipl...
Mihai Oltean, Crina Grosan
PAKDD
2007
ACM
203views Data Mining» more  PAKDD 2007»
14 years 5 months ago
Grammar Guided Genetic Programming for Flexible Neural Trees Optimization
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
Peng Wu, Yuehui Chen
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
14 years 4 months ago
Investigating the performance of module acquisition in cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is a form of the graph based Cartesian Genetic Programming (CGP) in which modules are automatically acquired and evolved. In this pap...
James Alfred Walker, Julian Francis Miller
GECCO
2009
Springer
107views Optimization» more  GECCO 2009»
14 years 3 months ago
Evolving distributed algorithms with genetic programming: election
In this paper, we present a detailed analysis of the application of Genetic Programming to the evolution of distributed algorithms. This research field has many facets which make...
Thomas Weise, Michael Zapf