48 search results - page 2 / 10 » Experimental Supplements to the Theoretical Analysis of EAs ... |
TCS
2010
13 years 3 months ago
2010
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
CHARME
2001
Springer
13 years 8 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
PPSN
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we use the exact model (or dynamical system approach) to describe the standard evolutionary algorithm (EA) as a discrete dynamical system for dynamic optimization pr...