5350 search results - page 199 / 1070 » Space and time in eco-ontologies |
158
click to vote
FOCS
2006
IEEE
16 years 19 days ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
127
click to vote
IPL
2010
15 years 5 months ago
2010
We develop a data structure for maintaining a dynamic multiset that uses O(n lg lg n/ lg n) bits and O(1) words, in addition to the space required by the n elements stored, suppor...
156
click to vote
FOCS
2007
IEEE
16 years 27 days ago
2007
IEEE
We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
177
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
157
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We benchmark an independent-restart-(1+1)-CMA-ES on the BBOB-2009 noisy testbed. The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions d...