History


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 | next | last

Result 1 to 20 of 22 total

Qualitative reachability in stochastic BPA games. (English)
Inf. Comput. 209, No. 8, 1160-1183 (2011).
WorldCat.org
1
Approximating the termination value of one-counter mdps and stochastic games. (English)
Comput. Res. Repos. 2011, Article No. 1104.4978 (2011).
WorldCat.org
2
Two views on multiple mean-payoff objectives in Markov decision processes. (English)
Comput. Res. Repos. 2011, Article No. 1104.3489 (2011).
WorldCat.org
3
Approximating the termination value of one-counter MDPs and stochastic games. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-22011-1/pbk). Lecture Notes in Computer Science 6756, 332-343 (2011).
WorldCat.org
4
Optimal strategies in infinite-state stochastic reachability games. (English)
Comput. Res. Repos. 2011, Article No. 1103.1065 (2011).
WorldCat.org
5
Approximating the termination value of one-counter mdps and stochastic games (English)
ICALP (2), 332-343 (2011).
WorldCat.org
6
Two views on multiple mean-payoff objectives in Markov decision processes (English)
LICS, 33-42 (2011).
WorldCat.org
7
One-counter stochastic games. (English)
Lodaya, Kamal (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2010), December 15‒18, 2010, Chennai, India. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-23-1). LIPICS ‒ Leibniz International Proceedings in Informatics 8, 108-119, electronic only (2010).
WorldCat.org
8
Qualitative reachability in stochastic BPA games. (English)
Comput. Res. Repos. 2010, Article No. 1003.0118 (2010).
WorldCat.org
9
One-counter Markov decision processes (English)
SODA, 863-874 (2010).
WorldCat.org
10
One-counter stochastic games (English)
FSTTCS, 108-119 (2010).
WorldCat.org
11
Qualitative reachability in stochastic BPA games. (English)
Albers, Susanne (ed.) et al., STACS 2009. 26th international symposium on theoretical aspects of computer science, Freiburg, Germany, February 26‒28, 2009. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-09-5). LIPICS ‒ Leibniz International Proceedings in Informatics 3, 207-218, electronic only (2009).
WorldCat.org
12
One-counter Markov decision processes. (English)
Comput. Res. Repos. 2009, Article No. 0904.2511 (2009).
WorldCat.org
13
Regularity in PDA games revisited. (English)
Electron. Notes Theor. Comput. Sci. 251, 5-16 (2009).
WorldCat.org
14
Branching-time model-checking of probabilistic pushdown automata. (English)
Electron. Notes Theor. Comput. Sci. 239, 73-83 (2009).
WorldCat.org
15
Qualitative reachability in stochastic BPA games (English)
STACS, 207-218 (2009).
WorldCat.org
16
Discounted properties of probabilistic pushdown automata. (English)
Cervesato, Iliano (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 15th international conference, LPAR 2008, Doha, Qatar, November 22‒27, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-89438-4/pbk). Lecture Notes in Computer Science 5330. Lecture Notes in Artificial Intelligence, 230-242 (2008).
WorldCat.org
17
Reachability in recursive Markov decision processes. (English)
Inf. Comput. 206, No. 5, 520-537 (2008).
WorldCat.org
18
Discounted properties of probabilistic pushdown automata (English)
LPAR, 230-242 (2008).
WorldCat.org
19
Reachability in recursive Markov decision processes. (English)
Baier, Christel (ed.) et al., CONCUR 2006 ‒ concurrency theory. 17th international conference, CONCUR 2006, Bonn, Germany, August 27‒30, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-37376-6/pbk). Lecture Notes in Computer Science 4137, 358-374 (2006).
WorldCat.org
20
first | previous | 1 21 | next | last

Result 1 to 20 of 22 total

Valid XHTML 1.0 Transitional Valid CSS!