Search results
- 1.0369977 - MÚ 2012 RIV US eng C - Conference Paper (international conference)
Hansen, A. K. - Koucký, Michal - Lauritzen, N. - Miltersen, P.B. - Tsigaridas, E.P.
Exact algorithms for solving stochastic games.
Proceedings of the 43rd annual ACM Symposium on Theory of Computing (STOC 2011). New York: ACM, 2011 - (Fortnow, L.; Vadhan, S.), s. 205-214. ISBN 978-1-4503-0691-1.
[43rd annual ACM symposium on Theory of computing (STOC 2011). San José (US), 06.06.2011-08.06.2011]
R&D Projects: GA ČR GAP202/10/0854; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : stochastic games * recursive games * algorithms
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?doid=1993636.1993665
Permanent Link: http://hdl.handle.net/11104/0203909File Download Size Commentary Version Access Koucky2.pdf 1 457.5 KB Author’s postprint require - 2.0336087 - MÚ 2010 RIV US eng C - Conference Paper (international conference)
Hansen, K.A. - Koucký, Michal - Miltersen, P.B.
Winning concurrent reachability games requires doubly-exponential patience.
Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LISC 2009. Los Angeles: IEEE Computer Society, 2009, s. 332-341. ISBN 978-0-7695-3746-7. ISSN 1043-6871.
[24th Annual IEEE Symposium on Logic in Computer Science. Los Angeles (US), 11.08.2009-14.08.2009]
R&D Projects: GA ČR GP201/07/P276; GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : concurrent reachability game * patience * winning strategies
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0180404File Download Size Commentary Version Access Koucky1.pdf 1 284 KB Publisher’s postprint require