9209 search results - page 44 / 1842 » Data Space Randomization |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper studies the problem of exact localization of multiple objects with noisy data. The crux of the proposed approach consists of random illumination. Two recovery methods ar...
COOPIS
2004
IEEE
14 years 1 months ago
2004
IEEE
Increasing demands for interconnectivity, adaptivity and flexibility are leading to distributed component-based systems (DCBS) where components may dynamically join and leave a sys...
KDD
2001
ACM
14 years 10 months ago
2001
ACM
Random projections have recently emerged as a powerful method for dimensionality reduction. Theoretical results indicate that the method preserves distances quite nicely; however,...
ICRA
2007
IEEE
14 years 4 months ago
2007
IEEE
— Randomly expanding trees are very effective in exploring high-dimensional spaces. Consequently, they are a powerful algorithmic approach to sampling-based single-query motion p...