Sciweavers

4198 search results - page 20 / 840
» In search of lost time
Sort
View
COCOA
2010
Springer
14 years 9 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
SAC
2002
ACM
14 years 11 months ago
Local search with annealing-like restarts to solve the vehicle routing problem with time windows
In this paper, we propose a metaheuristic based on snneedinglikerestarts to diversifyand intensifylocalsearches for solving the vehicle muting problem with time windows (VR_PTW). ...
Haibing Li, Andrew Lim
KI
2001
Springer
15 years 4 months ago
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
Stefan Edelkamp, Ulrich Meyer
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
15 years 1 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
ICPR
2010
IEEE
14 years 12 months ago
A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
Luisa Micó, José Oncina