Sciweavers

2899 search results - page 151 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
FOCS
2004
IEEE
15 years 9 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
IAT
2009
IEEE
16 years 25 days ago
Optimization-Based Collision Avoidance for Cooperating Airplanes
Application of autonomous intelligent systems into airspace domain is very important nowadays. The paper presents decentralized collision avoidance algorithm utilizing a solution ...
David Sislák, Premysl Volf, Michal Pechouce...
ICARCV
2008
IEEE
200views Robotics» more  ICARCV 2008»
16 years 16 days ago
A robot behavior-learning experiment using Particle Swarm Optimization for training a neural-based animat
— We investigate the use of Particle Swarm Optimization (PSO), and compare with Genetic Algorithms (GA), for a particular robot behavior-learning task: the training of an animat ...
Fabien Moutarde
ICNC
2005
Springer
15 years 11 months ago
On Evolutionary Optimization of Large Problems Using Small Populations
Abstract. Small populations are very desirable for reducing the required computational resources in evolutionary optimization of complex real-world problems. Unfortunately, the sea...
Yaochu Jin, Markus Olhofer, Bernhard Sendhoff
WSC
2007
15 years 8 months ago
Parallel cross-entropy optimization
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
Gareth E. Evans, Jonathan M. Keith, Dirk P. Kroese