Sciweavers

1119 search results - page 69 / 224
» Computing in the Presence of Timing Failures
Sort
View
DSN
2004
IEEE
14 years 26 days ago
Fault Tolerant Energy Aware Data Dissemination Protocol in Sensor Networks
In this paper we present a data dissemination protocol for efficiently distributing data through a sensor network in the face of node and link failures. Our work is motivated by t...
Gunjan Khanna, Saurabh Bagchi, Yu-Sung Wu
PODC
2009
ACM
14 years 9 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...
TCS
2008
13 years 9 months ago
A timed semantics of Orc
Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators su...
Ian Wehrman, David Kitchin, William R. Cook, Jayad...
ACCV
2009
Springer
14 years 3 months ago
Robust Real-Time Multiple Target Tracking
We propose a novel efficient algorithm for robust tracking of a fixed number of targets in real-time with low failure rate. The method is an instance of Sequential Importance Resa...
Nicolai von Hoyningen-Huene, Michael Beetz
ASWSD
2004
Springer
14 years 2 months ago
On the Fault Hypothesis for a Safety-Critical Real-Time System
– A safety-critical real-time computer system must provide its services with a dependability that is much better than the dependability of any one of its constituent components. ...
Hermann Kopetz