Sciweavers

313 search results - page 23 / 63
» Computing synchronizer failure probabilities
Sort
View
EUROPAR
2008
Springer
15 years 1 months ago
Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...
Emmanuel Jeannot, Erik Saule, Denis Trystram
SPAA
2010
ACM
15 years 4 months ago
Brief announcement: byzantine agreement with homonyms
In this work, we address Byzantine agreement in a message passing system with homonyms, i.e. a system with a number l of authenticated identities that is independent of the total ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
MATES
2007
Springer
15 years 5 months ago
Diagnosis of Plan Structure Violations
Failures in plan execution can be attributed to errors in the execution of plan steps or violations of the plan structure. The structure of a plan prescribes which actions have to ...
Nico Roos, Cees Witteveen
SENSYS
2005
ACM
15 years 5 months ago
Estimating clock uncertainty for efficient duty-cycling in sensor networks
Radio duty cycling has received significant attention in sensor networking literature, particularly in the form of protocols for medium access control and topology management. Whi...
Saurabh Ganeriwal, Deepak Ganesan, Hohyun Shim, Vl...
WDAG
2009
Springer
103views Algorithms» more  WDAG 2009»
15 years 6 months ago
Distributed Discovery of Large Near-Cliques
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
Zvika Brakerski, Boaz Patt-Shamir