1508 search results - page 20 / 302 » Efficient Path Profiling |
CASES
2001
ACM
14 years 1 months ago
2001
ACM
Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is th...
DCOSS
2007
Springer
14 years 1 months ago
2007
Springer
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
INFOCOM
2002
IEEE
14 years 2 months ago
2002
IEEE
—In MPLS/GMPLS networks, a range of restoration schemes will be required to support different tradeoffs between service interruption time and network resource utilization. In lig...
ICRA
2000
IEEE
14 years 1 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
CCCG
2010
13 years 11 months ago
2010
We present a data structure which represents a wellshaped convex tetrahedral mesh, M, in linear space such that path traversals visiting a sequence of K tetrahedra require O (K/ l...