<--- Back to Details
First PageDocument Content
Mathematics / Search algorithms / Distributed data storage / Information science / Discrete mathematics / Combinatorial optimization / Routing algorithms / Data mining / Nearest neighbor search / Distance oracle / A* search algorithm / Tapestry
Date: 2003-11-13 17:46:31
Mathematics
Search algorithms
Distributed data storage
Information science
Discrete mathematics
Combinatorial optimization
Routing algorithms
Data mining
Nearest neighbor search
Distance oracle
A* search algorithm
Tapestry

A Note on the Nearest Neighbor in Growth-Restricted Metrics Kirsten Hildrum John Kubiatowicz Sean Ma Satish Rao

Add to Reading List

Source URL: www.oceanstore.org

Download Document from Source Website

File Size: 67,92 KB

Share Document on Facebook

Similar Documents

Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm

Fast Evolutionary Adaptation for Monte Carlo Tree Search Simon M. Lucas, Spyridon Samothrakis and Diego Perez University of Essex, UK Abstract This paper describes a new adaptive Monte Carlo Tree Search (MCTS) algorithm

DocID: 1vdZY - View Document

Automatic Power System Restoration Application of a Search Algorithm Lars Lindgren

Automatic Power System Restoration Application of a Search Algorithm Lars Lindgren

DocID: 1up2e - View Document

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

DocID: 1ueLR - View Document

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

A Work-Efficient Algorithm for Parallel Unordered Depth-First Search Umut A. Acar Arthur Charguéraud

DocID: 1tFfm - View Document

________________________________ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem Gerardo Berbeglia Jean-François Cordeau

________________________________ A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem Gerardo Berbeglia Jean-François Cordeau

DocID: 1tqh4 - View Document