167 search results - page 3 / 34 » Adaptive Searching in One and Two Dimensions |
TSMC
2010
13 years 29 days ago
2010
In this paper, we propose two novel techniques, which successfully address several major problems in the field of particle swarm optimization (PSO) and promise a significant breakt...
HICSS
2002
IEEE
13 years 11 months ago
2002
IEEE
Abstract— Recent advances in graph-based search techniques derived from Kleinberg’s work [1] have been impressive. This paper further improves the graph-based search algorithm ...
CDC
2009
IEEE
13 years 4 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
WEA
2010
Springer
14 years 1 months ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
GECCO
2009
Springer
13 years 11 months ago
2009
Springer
We benchmark the BI-population CMA-ES on the BBOB2009 noisy functions testbed. BI-population refers to a multistart strategy with equal budgets for two interlaced restart strategi...