707 search results - page 72 / 142 » Solving path problems on the GPU |
AAAI
1990
15 years 1 months ago
1990
Knowledge processing is very demanding on computer architectures. Knowledge processing generates subcomputation paths at an exponential rate. It is memory intensive and has high c...
SODA
1990
ACM
15 years 1 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
118
click to vote
IJRR
2010
14 years 10 months ago
2010
Path planning and trajectory design for autonomous underwater vehicles (AUVs) is of great importance to the oceanographic research community because automated data collection is b...
102
click to vote
ISPA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. With the help of distributed hash tables, the structured peerto-peer system has a short routing path and good extensibility. However, the mismatch between the overlay and...
AMAI
2000
Springer
15 years 4 months ago
2000
Springer
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...