Pages that link to "Item:Q1262227"
From MaRDI portal
The following pages link to The complexity of dynamic programming (Q1262227):
Displayed 12 items.
- Finite-horizon Gaussianity-preserving event-based sensor scheduling in Kalman filter applications (Q311913) (← links)
- Knows what it knows: a framework for self-aware learning (Q413843) (← links)
- Reducing reinforcement learning to KWIK online regression (Q616761) (← links)
- Risk, uncertainty, and complexity (Q1309846) (← links)
- Computability, complexity and economics (Q1318305) (← links)
- On the complexity of linear quadratic control (Q1330536) (← links)
- Dimension reduction and its application to model-based exploration in continuous spaces (Q1959610) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- A consumption and investment problem via a Markov decision processes approach with random horizon (Q2153961) (← links)
- Symmetric Markovian games of commons with potentially sustainable endogenous growth (Q2245621) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Policy iteration accelerated with Krylov methods (Q5958353) (← links)