Sciweavers

511 search results - page 18 / 103
» Lower bounds for distributed markov chain problems
Sort
View
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
11 years 10 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
CONCUR
2011
Springer
12 years 7 months ago
Reasoning about Threads with Bounded Lock Chains
The problem of model checking threads interacting purely via the standard synchronization primitives is key for many concurrent program analyses, particularly dataflow analysis. U...
Vineet Kahlon
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 5 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...
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 3 months ago
Online Learning of Rested and Restless Bandits
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
Cem Tekin, Mingyan Liu
INFOCOM
2010
IEEE
13 years 6 months ago
Queuing Analysis in Multichannel Cognitive Spectrum Access: A Large Deviation Approach
Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each prima...
Amine Laourine, Shiyao Chen, Lang Tong