Pages that link to "Item:Q3780028"

The following pages link to The Complexity of Markov Decision Processes (Q3780028):

Displaying 50 items.

• Optimal cost almost-sure reachability in POMDPs (Q253969) (← links)
• What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives (Q269509) (← links)
• When is a pair of matrices mortal? (Q290262) (← links)
• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• Quantitative verification and strategy synthesis for stochastic games (Q328165) (← links)
• Optimal eviction policies for stochastic address traces (Q386897) (← links)
• Hybrid answer set programming (Q392277) (← links)
• A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
• Exploiting symmetries for single- and multi-agent partially observable stochastic domains (Q456732) (← links)
• Exact decomposition approaches for Markov decision processes: a survey (Q606196) (← links)
• Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (Q648368) (← links)
• Decentralized MDPs with sparse interactions (Q650520) (← links)
• Randomization for robot tasks: using dynamic programming in the space of knowledge states (Q686748) (← links)
• Parallel rollout for online solution of partially observable Markov decision processes (Q702170) (← links)
• On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
• Solving factored MDPs using non-homogeneous partitions (Q814475) (← links)
• Runtime monitors for Markov decision processes (Q832291) (← links)
• Probabilistic planning with clear preferences on missing information (Q835829) (← links)
• Cost-sensitive feature acquisition and classification (Q869033) (← links)
• New complexity results about Nash equilibria (Q932810) (← links)
• Partially observable Markov decision processes with imprecise parameters (Q1028935) (← links)
• On the control of discrete-event dynamical systems (Q1123861) (← links)
• On players with a bounded number of states (Q1187868) (← links)
• The complexity of dynamic programming (Q1262227) (← links)
• A theory of strict P-completeness (Q1337145) (← links)
• On the complexity of partially observed Markov decision processes (Q1351500) (← links)
• The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate (Q1367098) (← links)
• k-Certainty Exploration Method: an action selector to identify the environment in reinforcement learning (Q1392105) (← links)
• Reachability analysis of quantum Markov decision processes (Q1627964) (← links)
• On the computability of Solomonoff induction and AIXI (Q1704559) (← links)
• A novel scheduling index rule proposal for QoE maximization in wireless networks (Q1724668) (← links)
• Linear programming formulation for non-stationary, finite-horizon Markov decision process models (Q1728357) (← links)
• Computation of weighted sums of rewards for concurrent MDPs (Q1731592) (← links)
• A fast approximation method for partially observable Markov decision processes (Q1757693) (← links)
• Markov decision processes under observability constraints (Q1781146) (← links)
• On probabilistic timed automata. (Q1853732) (← links)
• A mean-variance optimization problem for discounted Markov decision processes (Q1926755) (← links)
• The partially observable Markov decision processes in healthcare: an application to patients with ischemic heart disease (IHD) (Q1937873) (← links)
• Game theory on attack graph for cyber deception (Q2056965) (← links)
• Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights (Q2108190) (← links)
• Verifying Pufferfish privacy in hidden Markov models (Q2152648) (← links)
• Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
• Reasoning about uncertain parameters and agent behaviors through encoded experiences and belief planning (Q2302297) (← links)
• POMDPs under probabilistic semantics (Q2344358) (← links)
• Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering (Q2364368) (← links)
• Robotic manipulation of multiple objects as a POMDP (Q2407434) (← links)
• Partially observable Markov decision model for the treatment of early prostate cancer (Q2430562) (← links)
• PageRank optimization by edge selection (Q2449060) (← links)
• Strong planning under partial observability (Q2457630) (← links)
• NP-hardness of checking the unichain condition in average cost MDPs (Q2467470) (← links)