Pages that link to "Item:Q4175068"

The following pages link to Approximations of Dynamic Programs, I (Q4175068):

Displaying 50 items.

• Computable approximations for continuous-time Markov decision processes on Borel spaces based on empirical measures (Q302091) (← links)
• (Approximate) iterated successive approximations algorithm for sequential decision processes (Q378751) (← links)
• A tutorial on event-based optimization -- a new optimization framework (Q461464) (← links)
• State aggregation in dynamic programming - an application to scheduling of independent jobs on parallel processors (Q593977) (← links)
• Approximation of Markov decision processes with general state space (Q663675) (← links)
• Computation of optimal policies in discounted semi-Markov decision chains (Q792229) (← links)
• Suboptimal policy determination for large-scale Markov decision processes. I: Description and bounds (Q799497) (← links)
• A convex optimization approach to dynamic programming in continuous state and action spaces (Q831365) (← links)
• Finite state approximation algorithms for average cost denumerable state Markov decision processes (Q1066819) (← links)
• Reward revision and the average reward Markov decision process (Q1097179) (← links)
• Discretization procedures for adaptive Markov control processes (Q1123872) (← links)
• Robustness inequality for Markov control processes with unbounded costs (Q1128542) (← links)
• Conditions for characterizing the structure of optimal strategies in infinite-horizon dynamic programs (Q1148824) (← links)
• The complexity of dynamic programming (Q1262227) (← links)
• Concepts and methods for discrete and continuous time control under uncertainty (Q1265914) (← links)
• Explicit solutions for multivariate, discrete-time control problems under uncertainty (Q1274249) (← links)
• Error bounds for nonnegative dynamic models (Q1291828) (← links)
• Estimating equilibrium probabilities for band diagonal Markov chains using aggregation and disaggregation techniques (Q1310051) (← links)
• A Bayesian dynamic programming approach to optimal maintenance combined with burn-in (Q1819274) (← links)
• Feature-based methods for large scale dynamic programming (Q1911341) (← links)
• Adaptive-resolution reinforcement learning with polynomial exploration in deterministic domains (Q1959632) (← links)
• Stochastic approximations of constrained discounted Markov decision processes (Q2338706) (← links)
• Algorithmic aspects of mean-variance optimization in Markov decision processes (Q2356186) (← links)
• Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) (← links)
• A multi-period TSP with stochastic regular and urgent demands (Q2456410) (← links)
• Error bounds for state space truncation of finite Jackson networks (Q2462116) (← links)
• Approximating infinite horizon stochastic optimal control in discrete time with constraints (Q2507412) (← links)
• On the construction of \(\epsilon\)-optimal strategies in partially observed MDPs (Q2638958) (← links)
• On truncations and perturbations of Markov decision problems with an application to queueing network overflow control (Q2638971) (← links)
• Empirical Dynamic Programming (Q2806811) (← links)
• A simulation-based approach to stochastic dynamic programming (Q2863720) (← links)
• A review of stochastic algorithms with continuous value function approximation and some new approximate policy iteration algorithms for multidimensional continuous applications (Q2887630) (← links)
• Approximation of Dynamic Programs (Q3112476) (← links)
• Dynamic coordination of production planning and sales admission control in the presence of a spot market (Q3560220) (← links)
• A unified view of aggregation and coherency in networks and Markov chains† (Q3683955) (← links)
• Some basic concepts of numerical treatment of Markov decision models (Q3743147) (← links)
• Discrete type shock semi-markov decision processes with borel state space (Q3835648) (← links)
• Bounds for aggregating nodes in network problems (Q3885553) (← links)
• Optimal control of discrete time population processes (Q3914879) (← links)
• Approximations of inventory models (Q3916343) (← links)
• Approximations and bounds for a generalized optimal stopping problem (Q3953584) (← links)
• (Q3971601) (← links)
• Adaptive policy-iteration and policy-value-iteration for discounted Markov decision processes (Q3984139) (← links)
• Markov Teams ? An analytical approach to process migration in distributed computing systems (Q4016361) (← links)
• On hedging in finite security markets (Q4541574) (← links)
• Discounted Continuous-Time Controlled Markov Chains: Convergence of Control Models (Q4903043) (← links)
• Some Limit Properties of Markov Chains Induced by Recursive Stochastic Algorithms (Q5037552) (← links)
• (Q5054599) (← links)
• Easy Affine Markov Decision Processes (Q5129219) (← links)
• (Q5389642) (← links)