Sciweavers

377 search results - page 68 / 76
» Distributed computation under bit constraints
Sort
View
SPAA
2003
ACM
14 years 27 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
MOBIHOC
2009
ACM
14 years 8 months ago
MotionCast: on the capacity and delay tradeoffs
In this paper, we define multicast for ad hoc network through nodes' mobility as MotionCast, and study the capacity and delay tradeoffs for it. Assuming nodes move according ...
Chenhui Hu, Xinbing Wang, Feng Wu
ICDCSW
2009
IEEE
14 years 2 months ago
Embedded Virtual Machines for Robust Wireless Control Systems
Embedded wireless networks have largely focused on openloop sensing and monitoring. To address actuation in closedloop wireless control systems there is a strong need to re-think ...
Rahul Mangharam, Miroslav Pajic
IPPS
2008
IEEE
14 years 2 months ago
Software monitoring with bounded overhead
In this paper, we introduce the new technique of HighConfidence Software Monitoring (HCSM), which allows one to perform software monitoring with bounded overhead and concomitantl...
Sean Callanan, David J. Dean, Michael Gorbovitski,...
IPPS
2006
IEEE
14 years 1 months ago
Composite Abortable Locks
The need to allow threads to abort an attempt to acquire a lock (sometimes called a timeout) is an interesting new requirement driven by state-of-the-art database applications wit...
Virendra J. Marathe, Mark Moir, Nir Shavit