123 search results - page 8 / 25 » Enumerating Triangulation Paths |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
IROS
2006
IEEE
14 years 1 months ago
2006
IEEE
— Current approaches to the visual homing for mobile robot navigation are generally inspired in insects’ behavior and based on the observed angular information of fixed points...
JCT
2008
13 years 7 months ago
2008
The enumeration of lattice paths in wedges poses unique mathematical challenges. These models are not translationally invariant, and the absence of this symmetry complicates both ...
CGO
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we present a technique for reducing the overhead of collecting path profiles in the context of a dynamic optimizer. The key idea to our approach, called Targeted Pa...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Accurate estimation of the worst-case execution time (WCET) of a program is important for real-time embedded software. Static WCET estimation involves program path analysis and ar...