79 search results - page 9 / 16 » Shortest path in a polygon using sublinear space |
119
click to vote
PDCAT
2007
Springer
15 years 10 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...
168
Voted
CORR
2012
Springer
13 years 11 months ago
2012
Springer
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
122
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Routing in wireless networks has been heavily studied in the last decade and numerous routing protocols were proposed in literature. The packets usually follow the short...
139
click to vote
GLVLSI
2009
IEEE
15 years 10 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
167
click to vote
TROB
2011
14 years 11 months ago
2011
— This paper defines and analyzes a simple robot with local sensors that moves in an unknown polygonal environment. The robot can execute wall-following motions and can traverse...