Sciweavers

2084 search results - page 184 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
178
Voted
PODC
2012
ACM
13 years 5 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
132
Voted
ATAL
2005
Springer
15 years 8 months ago
Exploiting belief bounds: practical POMDPs for personal assistant agents
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
Pradeep Varakantham, Rajiv T. Maheswaran, Milind T...
120
Voted
GLVLSI
2010
IEEE
190views VLSI» more  GLVLSI 2010»
15 years 4 months ago
A linear statistical analysis for full-chip leakage power with spatial correlation
In this paper, we present an approved linear-time algorithm for statistical leakage analysis in the present of any spatial correlation condition (strong or weak). The new algorith...
Ruijing Shen, Sheldon X.-D. Tan, Jinjun Xiong
141
Voted
ICPPW
2009
IEEE
15 years 11 days ago
Global Multiprocessor Real-Time Scheduling as a Constraint Satisfaction Problem
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...
Liliana Cucu-Grosjean, Olivier Buffet
110
Voted
RANDOM
1999
Springer
15 years 6 months ago
Scheduling with Unexpected Machine Breakdowns
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
Susanne Albers, Günter Schmidt