614 search results - page 72 / 123 » Local Computation: Lower and Upper Bounds |
PERCOM
2008
ACM
15 years 9 months ago
2008
ACM
This paper investigates wireless sensor networks where a small percentage of nodes are assumed to know their location a priori. These reference nodes enable absolute localization ...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
JGAA
2006
14 years 10 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
102
click to vote
JCAM
2010
14 years 4 months ago
2010
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
RTSS
2005
IEEE
15 years 3 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...