Sciweavers

113 search results - page 5 / 23
» The Effects of Local Randomness in the Adversarial Queueing ...
Sort
View
TMC
2012
11 years 9 months ago
Protecting Location Privacy in Sensor Networks against a Global Eavesdropper
— While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed. Such information can be c...
Kiran Mehta, Donggang Liu, Matthew Wright
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 4 months ago
One-Counter Markov Decision Processes
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...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
14 years 7 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
LANC
2009
ACM
178views Education» more  LANC 2009»
14 years 1 days ago
A connection level model for IEEE 802.11 cells
We study a wireless network under the 802.11 random access protocol, supporting multiple physical layer rates. Based on models for the effective packet rates achieved at the MAC ...
Andrés Ferragut, Fernando Paganini
VALUETOOLS
2006
ACM
149views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Tail asymptotics for discrete event systems
In the context of communication networks, the framework of stochastic event graphs allows a modeling of control mechanisms induced by the communication protocol and an analysis of ...
Marc Lelarge