This paper benchmarks the particle swarm optimizer with adaptive bounds algorithm (PSO Bounds) on the noisefree BBOB 2009 testbed. The algorithm is further augmented with a simple...
In this paper, we benchmark the (1+1) Evolution Strategy (ES) with one-fifth success rule which is one of the first and simplest adaptive search algorithms proposed for optimiza...
The (1+1)-ES with one-fifth success rule is one of the first and simplest stochastic algorithm proposed for optimization on a continuous search space in a black-box scenario. In...
The restarted Rosenbrock’s optimization algorithm is tested on the BBOB 2009 testbed. The algorithm turned out to be very efficient for functions with simple structure (independ...
In this work we evaluate a Particle Swarm Optimizer hybridized with Differential Evolution and apply it to the BlackBox Optimization Benchmarking for noisy functions (BBOB 2009)....
We propose a cooperative-coevolution – Parisian trend – algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It i...
New portable consumer embedded devices must execute multimedia applications (e.g., 3D games, video players and signal processing software, etc.) that demand extensive memory acces...
Dealing with imprecise information is a common characteristic in real-world problems. Specifically, when the source of the information are physical sensors, a level of noise in t...
Evolutionary problem decomposition techniques divide a complex problem into simpler subproblems, evolve individuals to produce subcomponents that solve the subproblems, and then a...
Heather Goldsby, Sherri Goings, Jeff Clune, Charle...