Pages that link to "Item:Q2546840"

The following pages link to Iterative solution of the functional equations of undiscounted Markov renewal programming (Q2546840):

Displaying 48 items.

• On discounted AR-AT semi-Markov games and its complementarity formulations (Q328548) (← links)
• New average optimality conditions for semi-Markov decision processes in Borel spaces (Q438786) (← links)
• A Poisson equation for the risk-sensitive average cost in semi-Markov chains (Q513817) (← links)
• Semi-Markov control models with partially known holding times distribution: discounted and average criteria (Q538382) (← links)
• The numerical exploitation of periodicity in Markov decision processes (Q594776) (← links)
• Optimal dynamic routing in flexible manufacturing systems with limited buffers (Q918382) (← links)
• Finite state approximation algorithms for average cost denumerable state Markov decision processes (Q1066819) (← links)
• Generalized polynomial approximations in Markovian decision processes (Q1066821) (← links)
• Variational characterizations in Markov decision processes (Q1077334) (← links)
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks (Q1085077) (← links)
• Dual bounds on the equilibrium distribution of a finite Markov chain (Q1092519) (← links)
• A pause control approach to the value iteration scheme in average Markov decision processes (Q1128694) (← links)
• A note on the convergence rate of the value iteration scheme in controlled Markov chains (Q1128695) (← links)
• Nonstationary Markov decision problems with converging parameters (Q1136706) (← links)
• Successive approximations for average reward Markov games (Q1137522) (← links)
• The blast furnaces problem (Q1138986) (← links)
• The method of value oriented successive approximations for the average reward Markov decision process (Q1144501) (← links)
• Solving linear systems by methods based on a probabilistic interpretation (Q1144900) (← links)
• Action-dependent stopping times and Markov decision process with unbounded rewards (Q1158111) (← links)
• Criteria for selecting the relaxation factor of the value iteration algorithm for undiscounted Markov and semi-Markov decision processes (Q1178729) (← links)
• Optimization of file migration policies in distributed computer systems (Q1200826) (← links)
• Semi-Markov processes and their applications (Q1231232) (← links)
• Contraction mappings underlying undiscounted Markov decision problems (Q1250794) (← links)
• A \(K\)-step look-ahead analysis of value iteration algorithms for Markov decision processes (Q1266643) (← links)
• Look-back policies for two-stage, pull-type production/inventory systems (Q1315353) (← links)
• Coordinated production and inspection in a tandem system (Q1357708) (← links)
• Illustrated review of convergence conditions of the value iteration algorithm and the rolling horizon procedure for average-cost MDPs (Q1761758) (← links)
• Computing semi-stationary optimal policies for multichain semi-Markov decision processes (Q2177806) (← links)
• Optimal control of a queueing network system with two types of customers (Q2277683) (← links)
• A structured pattern matrix algorithm for multichain Markov decision processes (Q2465379) (← links)
• Optimal dynamic assignment of a flexible worker on an open production line with specialists (Q2572254) (← links)
• On regularly perturbed fundamental matrices (Q2643996) (← links)
• On-line scheduling of a robotic manufacturing cell with stochastic sequence-dependent processing rates (Q3026720) (← links)
• Iterative algorithms for solving undiscounted bellman equations (Q3032902) (← links)
• A value-iteration scheme for undiscounted multichain Markov renewal programs (Q3221782) (← links)
• A Fixed Point Approach to Undiscounted Markov Renewal Programs (Q3347663) (← links)
• Successive approximations in partially observable controlled Markov chains with risk-sensitive average criterion (Q3368567) (← links)
• Iterative Bounds on the Equilibrium Distribution of a Finite Markov Chain (Q3415834) (← links)
• On the Optimality of Trunk Reservation in Overflow Processes (Q3416021) (← links)
• A value iteration method for undiscounted multichain Markov decision processes (Q3789375) (← links)
• Improved iterative computation of the expected discounted return in Markov and semi-Markov chains (Q3885559) (← links)
• On the functional equations in undiscounted and sensitive discounted stochastic games (Q3893705) (← links)
• Optimal control of discrete time population processes (Q3914879) (← links)
• Computation techniques for large scale undiscounted markov decision processes (Q3962809) (← links)
• A simulation analysis of robot service movements in FMC (Q4398926) (← links)
• On zero-sum two-person undiscounted semi-Markov games with a multichain structure (Q5233191) (← links)
• Nonstationary value iteration in controlled Markov chains with risk-sensitive average criterion (Q5476137) (← links)
• Stochastic Inventory Models with Limited Production Capacity and Periodically Varying Parameters (Q5488539) (← links)