707 search results - page 30 / 142 » Solving path problems on the GPU |
CCCG
2010
15 years 1 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
CCCG
2010
15 years 1 months ago
2010
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
— The paper studies the coordinated path following problem, namely, steering a group of unicycles to a given path while achieving an inter-vehicle formation pattern. A novel hybr...
COLING
2008
15 years 1 months ago
2008
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...
EOR
2006
14 years 11 months ago
2006
: This paper addresses the problem of computing minimum risk paths by taking as objective the expected accident cost. The computation is based on a dynamic programming formulation ...