4229 search results - page 21 / 846 » On the Optimality of Spiral Search |
EUROGP
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. In this paper we consider a new class of search and optimization algorithms inspired by molecular dynamics simulations in physics.
FOCS
2004
IEEE
15 years 2 months ago
2004
IEEE
We present an O(lg lg n)-competitive online binary search tree, improving upon the best previous (trivial) competitive ratio of O(lg n). This is the first major progress on Sleator...
MOBICOM
2004
ACM
15 years 4 months ago
2004
ACM
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
Simulated annealing and the (1+1) EA, a simple evolutionary algorithm, are both general randomized search heuristics that optimize any objective function with probability
119
click to vote
EDBT
2012
ACM
13 years 1 months ago
2012
ACM
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...