We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
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...
Consider the problem of estimating the small probability that the maximum of a random walk exceeds a large threshold, when the process has a negative drift and the underlying rand...
Abstract—This paper studies large randomly spread directsequence code-division multiple-access system operating over a block fading multipath channel. Channel knowledge is obtain...
Graphs provide an excellent framework for interrogating symmetric models of measurement random variables and discovering their implied conditional independence structure. However,...