Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

GECCO
2008
Springer

favoriteEmaildiscussreport

142views Optimization» more GECCO 2008»

Memetic algorithms with variable-depth search to overcome local optima

13 years 12 months ago

Memetic algorithms with variable-depth search to overcome local optima

Download www.cs.bham.ac.uk

Dirk Sudholt

Real-time Traffic

GECCO 2008 | Optimization |

claim paper

Related Content

» A novel memetic algorithm for constrained optimization

» Some Issues on the Implementation of Local Search in Evolutionary Multiobjective Optimizat...

» A Memetic Pareto Evolutionary Approach to Artificial Neural Networks

» A Niching Memetic Algorithm for Simultaneous Clustering and Feature Selection

» ClassificationAssisted Memetic Algorithms for EqualityConstrained Optimization Problems

» A CostBenefitBased Adaptation Scheme for Multimeme Algorithms

» How randomized search heuristics find maximum cliques in planar graphs

» Generalized crowding for genetic algorithms

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2008
Where	GECCO
Authors	Dirk Sudholt

Comments (0)