Pages that link to "Item:Q3830830"
From MaRDI portal
The following pages link to Adaptive aggregation methods for infinite horizon dynamic programming (Q3830830):
Displaying 25 items.
- Adaptive aggregation for reinforcement learning in average reward Markov decision processes (Q378753) (← links)
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
- Solving factored MDPs using non-homogeneous partitions (Q814475) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- Near optimization of dynamic systems by decomposition and aggregation (Q1273157) (← links)
- Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (Q1310051) (← links)
- Numerical methods for controlled and uncontrolled multiplexing and queueing systems (Q1331289) (← links)
- Abstraction and approximate decision-theoretic planning. (Q1399130) (← links)
- Stochastic dynamic programming with factored representations (Q1583230) (← links)
- Bounded-parameter Markov decision processes (Q1583513) (← links)
- Adaptive differential dynamic programming for multiobjective optimal control (Q1614332) (← links)
- An incremental off-policy search in a model-free Markov decision process using a single sample path (Q1621868) (← links)
- Generic rank-one corrections for value iteration in Markovian decision problems (Q1905071) (← links)
- Feature-based methods for large scale dynamic programming (Q1911341) (← links)
- An aggregation-based approximate dynamic programming approach for the periodic review model with random yield (Q2333003) (← links)
- Block-scaling of value-iteration for discounted Markov renewal programming (Q2638962) (← links)
- Replacement process decomposition for discounted Markov renewal programming (Q2638963) (← links)
- Approximate dynamic programming with state aggregation applied to UAV perimeter patrol (Q2903989) (← links)
- Agent's actions as a classification criteria for the state space in a learning from rewards system (Q3543672) (← links)
- What you should know about approximate dynamic programming (Q3621932) (← links)
- Two adaptively stepped monotone algorithms for solving discounted dynamic programming equations (Q4293291) (← links)
- (Q4453232) (← links)
- Multilevel Preconditioners for Temporal-Difference Learning Methods Related to Recommendation Engines (Q4915474) (← links)
- Infinite Horizon Average Cost Dynamic Programming Subject to Total Variation Distance Ambiguity (Q5232245) (← links)
- Approximate dynamic programming via iterated Bellman inequalities (Q5256802) (← links)
