Sciweavers

1725 search results - page 43 / 345
» Relaxed genetic programming
Sort
View
IOR
2011
175views more  IOR 2011»
13 years 6 months ago
Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
Balabhaskar Balasundaram, Sergiy Butenko, Illya V....
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
14 years 2 months ago
Alternative evolutionary algorithms for evolving programs: evolution strategies and steady state GP
In contrast with the diverse array of genetic algorithms, the Genetic Programming (GP) paradigm is usually applied in a relatively uniform manner. Heuristics have developed over t...
L. Darrell Whitley, Marc D. Richards, J. Ross Beve...
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
14 years 3 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
EUROGP
2010
Springer
172views Optimization» more  EUROGP 2010»
14 years 2 months ago
Geometric Differential Evolution on the Space of Genetic Programs
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...
Alberto Moraglio, Sara Silva
EUROGP
2008
Springer
128views Optimization» more  EUROGP 2008»
14 years 28 days ago
Hardware Accelerators for Cartesian Genetic Programming
A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidat...
Zdenek Vasícek, Lukás Sekanina