5316 search results - page 269 / 1064 » Which Search Problems Are Random |
140
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
162
click to vote
ICRA
2006
IEEE
15 years 11 months ago
2006
IEEE
— The dangerous and time sensitive nature of a disaster area makes it an ideal application for robotic exploration. Our long term goal is to enable humans, software agents, and a...
264
click to vote
ICDE
2002
IEEE
16 years 6 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
116
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
133
Voted
PR
2006
15 years 4 months ago
2006
A conventional way to discriminate between objects represented by dissimilarities is the nearest neighbor method. A more efficient and sometimes a more accurate solution is offere...