Pages that link to "Item:Q3189650"
From MaRDI portal
The following pages link to Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650):
Displaying 20 items.
- Optimal cost almost-sure reachability in POMDPs (Q253969) (← links)
- Trading performance for stability in Markov decision processes (Q340568) (← links)
- Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (Q518409) (← links)
- Quantitative fair simulation games (Q528184) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
- Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
- Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives (Q2257302) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- Generic Emptiness Check for Fun and Profit (Q3297604) (← links)
- Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (Q3448829) (← links)
- (Q5015274) (← links)
- (Q5129946) (← links)
- (Q5141616) (← links)
- Measuring and Synthesizing Systems in Probabilistic Environments (Q5501954) (← links)
- Combinations of Qualitative Winning for Stochastic Parity Games (Q5875367) (← links)
- (Q5875368) (← links)
- (Q5875369) (← links)
