1508 search results - page 11 / 302 » Efficient Path Profiling |
81
Voted
IJWET
2008
14 years 10 months ago
2008
: Information-filtering systems constitute a critical component of modern information-seeking applications. As the number of users grows and the amount of information available bec...
92
Voted
TELSYS
2002
14 years 10 months ago
2002
The path recovery in MPLS is the technique to reroute traffic around a failure or congestion in a LSP. Currently, there are two kinds of model for path recovery: rerouting and prot...
100
Voted
IWANN
1997
Springer
15 years 2 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...
112
Voted
COMGEO
2006
ACM
14 years 10 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
81
Voted
CCCG
2006
14 years 11 months ago
2006
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...