( en | de | ru )

 

Disambiguation of "Brázdil, Tomás"

Author of the publication

copydeleteadd this publication to your clipboard
Reachability in Recursive Markov Decision Processes.

, , , and . CONCUR, volume 4137 of Lecture Notes in Computer Science, page 358-374. Springer, (2006)

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. You can also use the button next to the name to display some publications already assigned to the person.

Tomás Núñez

Tomás Vinar

Ana Teresa Monteiro Tomás

Tomás Barros

Tomás Mácha

 

Other publications of authors with the same name

Efficient Controller Synthesis for Consumption Games with Multiple Resource Types., , , and . CAV, volume 7358 of Lecture Notes in Computer Science, page 23-38. Springer, (2012)Efficient Algorithms for Checking Fast Termination in VASS., , , , and . CoRR, (2017)Runtime Analysis of Probabilistic Programs with Unbounded Recursion., , , and . ICALP (2), volume 6756 of Lecture Notes in Computer Science, page 319-331. Springer, (2011)On-the-fly adaptation of patrolling strategies in changing environments., , , , , and . UAI, volume 180 of Proceedings of Machine Learning Research, page 244-254. PMLR, (2022)Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent., , , , and . QEST, volume 9826 of Lecture Notes in Computer Science, page 244-259. Springer, (2016)Space-Efficient Scheduling of Stochastically Generated Tasks., , , and . ICALP (2), volume 6199 of Lecture Notes in Computer Science, page 539-550. Springer, (2010)Solving Patrolling Problems in the Internet Environment., , and . IJCAI, page 121-127. ijcai.org, (2018)Unbounded Orchestrations of Transducers for Manufacturing., , , , , and . AAAI, page 2646-2653. AAAI Press, (2019)Strategy Representation by Decision Trees in Reactive Synthesis., , , and . TACAS (1), volume 10805 of Lecture Notes in Computer Science, page 385-407. Springer, (2018)On the Decidability of Temporal Properties of Probabilistic Pushdown Automata., , and . STACS, volume 3404 of Lecture Notes in Computer Science, page 145-157. Springer, (2005)