Pages that link to "Item:Q1641009"
From MaRDI portal
The following pages link to Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009):
Displayed 9 items.
- Model-free reinforcement learning for branching Markov decision processes (Q832301) (← links)
- Approximate minimization of weighted tree automata (Q2064525) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- Item:Q1641009 (redirect page) (← links)
- (Q4585069) (← links)
- (Q5009454) (← links)
- (Q5091277) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
- A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (Q5363381) (← links)