25 search results - page 1 / 5 » Inferring Lower Bounds for Runtime Complexity |
CEC
2005
IEEE
13 years 10 months ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
PODS
2006
ACM
14 years 4 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
ICAART
2010
INSTICC
14 years 1 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
GECCO
2008
Springer
13 years 5 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
CVPR
2011
IEEE
13 years 22 days ago
2011
IEEE
Combining information from the higher level and the lower level has long been recognized as an essential component in holistic image understanding. However, an efficient inferenc...