Sciweavers

1091 search results - page 126 / 219
» On the temporal dimension of search
Sort
View
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
16 years 2 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
CEC
2005
IEEE
15 years 7 months ago
A population-based, steady-state procedure for real-parameter optimization
Despite the existence of a number of procedures for real-parameter optimization using evolutionary algorithms, there is still a need of a systematic and unbiased comparison of di...
Ankur Sinha, Santosh Tiwari, Kalyanmoy Deb
ATAL
2004
Springer
15 years 7 months ago
Time-Variant Distributed Agent Matching Applications
The process of pair partnership formation is an important infrastructure for many plausible MAS applications. Each agent evaluates potential partner agents, where each potential m...
David Sarne, Sarit Kraus
GECCO
2010
Springer
188views Optimization» more  GECCO 2010»
15 years 5 months ago
Benchmarking real-coded genetic algorithm on noisy black-box optimization testbed
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
Thanh-Do Tran, Gang-Gyoo Jin
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 3 months ago
Mirrored variants of the (1, 2)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirroring has been recently introduced to enhance the performances of (1, λ)-EvolutionStrategies (ESs) with the aim of designing fast robust local sea...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen