3055 search results - page 261 / 611 » Randomized Search Trees |
146
Voted
ESA
2005
Springer
15 years 8 months ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
109
click to vote
CIMCA
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, a distributed and adaptive approach for resource discovery in peer-to-peer networks is presented. This approach is based on the mobile agent paradigm and the random...
142
Voted
STOC
2004
ACM
16 years 3 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
105
click to vote
GECCO
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we present simple and genetic forms of an evolutionary paradigm known as a society of hill-climbers (SoHC). We compare these simple and genetic SoHCs on a test suite...
200
Voted
ICDE
2006
IEEE
16 years 4 months ago
2006
IEEE
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...