277 search results - page 14 / 56 » New results on shortest paths in three dimensions |
PDCAT
2007
Springer
14 years 1 months ago
2007
Springer
A circulant graph with n nodes and jumps j1, j2, ..., jm is a graph in which each node i, 0 ≤ i ≤ n−1, is adjacent to all the vertices i±jk mod n, where 1 ≤ k ≤ m. A bi...
ICRA
2000
IEEE
14 years 2 days ago
2000
IEEE
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
HICSS
2012
IEEE
12 years 3 months ago
2012
IEEE
—The selection of a path in a network from one node to another is performed by a routing protocol, often using the shortest path approach. However, it has been shown that in wire...
CAL
2008
13 years 7 months ago
2008
Abstract-- This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized PartiallyMinimal (RPM) routing that provably achieves optimal worstcase thr...
PVLDB
2008
13 years 7 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...