This HTML5 document contains 47 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n23http://purl.org/net/nknouf/ns/bibtex#
n19http://localhost/temp/predkladatel/
n20http://linked.opendata.cz/resource/domain/vavai/projekt/
n10http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/resource/domain/vavai/subjekt/
n17http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n5http://bibframe.org/vocab/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F12%3A00057577%21RIV13-GA0-14330___/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F12%3A00057577%21RIV13-GA0-14330___
rdf:type
skos:Concept n17:Vysledek
dcterms: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 > 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. 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 > 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.
dcterms:title
Minimizing Expected Termination Time in One-Counter Markov Decision Processes Minimizing Expected Termination Time in One-Counter Markov Decision Processes
skos:prefLabel
Minimizing Expected Termination Time in One-Counter Markov Decision Processes Minimizing Expected Termination Time in One-Counter Markov Decision Processes
skos:notation
RIV/00216224:14330/12:00057577!RIV13-GA0-14330___
n17:predkladatel
n18:orjk%3A14330
n3:aktivita
n4:P
n3:aktivity
P(GAP202/10/1469), P(GPP202/12/P612)
n3:dodaniDat
n12:2013
n3:domaciTvurceVysledku
n10:1762834 n10:2158507 n10:9872655
n3:druhVysledku
n11:D
n3:duvernostUdaju
n22:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
150658
n3:idVysledku
RIV/00216224:14330/12:00057577
n3:jazykVysledku
n13:eng
n3:klicovaSlova
one-counter automata; markov decision processes
n3:klicoveSlovo
n9:one-counter%20automata n9:markov%20decision%20processes
n3:kontrolniKodProRIV
[BB9CD208EA48]
n3:mistoKonaniAkce
Warwick
n3:mistoVydani
Berlin
n3:nazevZdroje
Proceedings of 39th International Colloquium on Automata, Languages and Programming (ICALP 2012)
n3:obor
n6:IN
n3:pocetDomacichTvurcuVysledku
3
n3:pocetTvurcuVysledku
4
n3:projekt
n20:GPP202%2F12%2FP612 n20:GAP202%2F10%2F1469
n3:rokUplatneniVysledku
n12:2012
n3:tvurceVysledku
Wojtczak, Dominik Kučera, Antonín Novotný, Petr Brázdil, Tomáš
n3:typAkce
n16:WRD
n3:zahajeniAkce
2012-01-01+01:00
s:issn
0302-9743
s:numberOfPages
12
n5:doi
10.1007/978-3-642-31585-5_16
n23:hasPublisher
Springer-Verlag
n21:isbn
9783642315848
n19:organizacniJednotka
14330