All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Minimizing Expected Termination Time in One-Counter Markov Decision Processes

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057577" target="_blank" >RIV/00216224:14330/12:00057577 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-642-31585-5_16" target="_blank" >http://dx.doi.org/10.1007/978-3-642-31585-5_16</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-642-31585-5_16" target="_blank" >10.1007/978-3-642-31585-5_16</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Minimizing Expected Termination Time in One-Counter Markov Decision Processes

  • Original language description

    We consider the problem of computing the value and an optimal strategy for minimizing the expected termination time in one-counter Markov decision processes. Since the value may be irrational and an optimal strategy may be rather complicated, we concentrate on the problems of approximating the value up to a given error epsilon &gt; 0 and computing a finite representation of an epsilon-optimal strategy. We show that these problems are solvable in exponential time for a given configuration, and we also show that they are computationally hard in the sense that a polynomial-time approximation algorithm cannot exist unless P=NP.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012)

  • ISBN

    9783642315848

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    141-152

  • Publisher name

    Springer

  • Place of publication

    Berlin

  • Event location

    Warwick

  • Event date

    Jan 1, 2012

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article