Pages that link to "Item:Q2638964"
From MaRDI portal
The following pages link to Solving H-horizon, stationary Markov decision problems in time proportional to log (H) (Q2638964):
Displaying 15 items.
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
- The value iteration algorithm is not strongly polynomial for discounted dynamic programming (Q1667204) (← links)
- Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming (Q1785275) (← links)
- An active-set strategy to solve Markov decision processes with good-deal risk measure (Q2329646) (← links)
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← links)
- Reachability analysis of uncertain systems using bounded-parameter Markov decision processes (Q2389641) (← links)
- PageRank optimization by edge selection (Q2449060) (← links)
- Complexity bounds for approximately solving discounted MDPs by value iterations (Q2661516) (← links)
- Value Iteration (Q3512436) (← links)
- Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes (Q4607932) (← links)
- Temporal concatenation for Markov decision processes (Q5051192) (← links)
- Uniform Turnpike Theorems for Finite Markov Decision Processes (Q5108234) (← links)
- Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time (Q5119845) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
