2084 search results - page 268 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
143
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
153
click to vote
TSP
2010
14 years 9 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
123
click to vote
COMCOM
1998
15 years 2 months ago
1998
Multimedia applications involving digital audio and/or digital video transmissions require strict QoS constraints (end-to-end delay bound, bandwidth availability, packet loss rate...
115
click to vote
LATA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
128
click to vote
CN
2002
15 years 2 months ago
2002
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...