Pages that link to "Item:Q2713008"

The following pages link to Computing average optimal constrained policies in stochastic dynamic programming. (Q2713008):

Displaying 8 items.

• A reinforcement learning approach to call admission and call dropping control in links with variable capacity (Q431777) (← links)
• The vanishing discount approach to constrained continuous-time controlled Markov chains (Q709279) (← links)
• Computing efficient steady state policies for deterministic dynamic programs. I (Q1191780) (← links)
• Computing efficient steady state policies for deterministic dynamic programs. II (Q1260897) (← links)
• Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem (Q1847251) (← links)
• Speeding up stochastic dynamic programming with zero-delay convolution (Q2865860) (← links)
• Stochastic Depletion Problems: Effective Myopic Policies for a Class of Dynamic Optimization Problems (Q3169038) (← links)
• A Policy Improvement Method in Constrained Stochastic Dynamic Programming (Q5281937) (← links)