763 search results - page 109 / 153 » Engineering Shortest Path Algorithms |
VTC
2006
IEEE
14 years 3 months ago
2006
IEEE
— There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Recently, there have been different locali...
ICPP
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
DCOSS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
WADS
2005
Springer
14 years 3 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
ICCAD
1996
IEEE
14 years 1 months ago
1996
IEEE
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...