168 search results - page 34 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
There is a growing interest in on-line algorithms for analyzing and querying data streams, that examine each stream element only once and have at their disposal, only a limited amo...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
WSNA
2003
ACM
13 years 10 months ago
2003
ACM
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...