2084 search results - page 77 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
COLT
2000
Springer
15 years 2 months ago
2000
Springer
We give the first rigorous upper bounds on the error of temporal difference (td) algorithms for policy evaluation as a function of the amount of experience. These upper bounds pr...
CSREASAM
2003
14 years 11 months ago
2003
We introduce and analyze a randomized traitor tracing algorithm for broadcast security. This algorithm is very efficient compared to brute force methods (the mean time it takes is...
ICASSP
2009
IEEE
2009
IEEE
Time-space-sequential algorithms for distributed Bayesian state estimation in serial sensor networks
15 years 4 months ago
We consider distributed estimation of a time-dependent, random state vector based on a generally nonlinear/non-Gaussian state-space model. The current state is sensed by a serial ...
ATAL
2004
Springer
15 years 3 months ago
2004
Springer
Despite the recent advances in distributed MDP frameworks for reasoning about multiagent teams, these frameworks mostly do not reason about resource constraints, a crucial issue i...