Sciweavers

7522 search results - page 71 / 1505
» Spacing memetic algorithms
Sort
View
TEC
2002
183views more  TEC 2002»
15 years 4 days ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
81
Voted
GECCO
2004
Springer
15 years 5 months ago
Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
Matthew J. Streeter
COMGEO
2002
ACM
15 years 10 days ago
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited
The goals of this paper are twofold. The first is to present a new sampling theory for curves, based on a new notion of local feature size. The properties of this new feature size...
Daniel Freedman
99
Voted
ICML
2003
IEEE
16 years 1 months ago
Exploration in Metric State Spaces
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
Sham Kakade, Michael J. Kearns, John Langford
VISUALIZATION
1996
IEEE
15 years 4 months ago
Isosurfacing in Span Space with Utmost Efficiency (ISSUE)
We present efficient sequential and parallel algorithms for isosurface extraction. Based on the Span Space data representation, new data subdivision and searching methods are desc...
Han-Wei Shen, Charles D. Hansen, Yarden Livnat, Ch...