From post

Regstar: efficient strategy synthesis for adversarial patrolling games.

, , , и . UAI, том 161 из Proceedings of Machine Learning Research, стр. 471-481. AUAI Press, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

On Relative Randomness.. Ann. Pure Appl. Log., 63 (1): 61-67 (1993)Preface., , , , и . Fundam. Informaticae, (2013)On Homogeneous Segments., , и . TSD, том 2807 из Lecture Notes in Computer Science, стр. 152-157. Springer, (2003)Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems., , и . CONCUR, том 3170 из Lecture Notes in Computer Science, стр. 193-208. Springer, (2004)Measuring performance of continuous-time stochastic processes using timed automata., , , , и . HSCC, стр. 33-42. ACM, (2011)Efficient Analysis of Probabilistic Programs with an Unbounded Counter., , и . CAV, том 6806 из Lecture Notes in Computer Science, стр. 208-224. Springer, (2011)Preface., и . Theor. Comput. Sci., (2012)The satisfiability problem for a quantitative fragment of PCTL., и . J. Comput. Syst. Sci., (февраля 2024)Runtime analysis of probabilistic programs with unbounded recursion., , , и . J. Comput. Syst. Sci., 81 (1): 288-310 (2015)Analyzing probabilistic pushdown automata., , , и . Formal Methods in System Design, 43 (2): 124-163 (2013)