The following pages link to Mathieu Tracol (Q269508):
Displaying 7 items.
- What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
- Recurrence and transience for finite probabilistic tables (Q631776) (← links)
- Fast convergence to state-action frequency polytopes for MDPs (Q1015315) (← links)
- Approximation of Large Probabilistic Networks by Structured Population Protocols (Q2850016) (← links)
- Recurrence and Transience for Probabilistic Automata. (Q2920147) (← links)
- What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives. (Q2958521) (← links)
- Decidable Problems for Probabilistic Automata on Infinite Words (Q2986795) (← links)
