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...
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
Various stochastic programmingproblemscan be formulated as problems of optimization of an expected value function. Quite often the corresponding expectation function cannot be com...
— This paper is based on a comprehensive dynamic mathematical model (Copernicus) of vascular bubble formation and growth during and after decompression from a dive. The model des...
Le Feng, Christian R. Gutvik, Tor Arne Johansen, D...
Abstract. In this paper we present a dynamic programming formulation of a hybrid optimal control problem for bimodal systems with regional dynamics. In particular, based on optimal...
Peter E. Caines, Magnus Egerstedt, Roland P. Malha...