Login / Signup

Empirical computation of the quasi-optimal number of informants in particle swarm optimization.

José García-NietoEnrique Alba
Published in: GECCO (2011)
Keyphrases
  • particle swarm optimization
  • dynamic programming
  • small number
  • image sequences
  • computational complexity
  • differential evolution
  • e learning
  • theoretical analysis
  • determine the optimal number