Pages that link to "Item:Q3986758"
From MaRDI portal
The following pages link to An Analysis of Stochastic Shortest Path Problems (Q3986758):
Displaying 50 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- Dynamic shortest path problems: hybrid routing policies considering network disruptions (Q336651) (← links)
- PH-graphs for analyzing shortest path problems with correlated traveling times (Q337529) (← links)
- On an exact method for the constrained shortest path problem (Q339592) (← links)
- Q-learning and policy iteration algorithms for stochastic shortest path problems (Q378731) (← links)
- Depth-based short-sighted stochastic shortest path problems (Q460624) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata (Q517046) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- Teaching randomized learners with feedback (Q553294) (← links)
- A game-based abstraction-refinement framework for Markov decision processes (Q600979) (← links)
- Efficient solutions to factored MDPs with imprecise transition probabilities (Q646498) (← links)
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities (Q648368) (← links)
- Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
- Performance analysis of probabilistic timed automata using digital clocks (Q853731) (← links)
- Real-time dynamic programming for Markov decision processes with imprecise probabilities (Q901046) (← links)
- Optimization of a peer-to-peer system for efficient content replication (Q1027520) (← links)
- Optimal threshold probability in undiscounted Markov decision processes with a target set. (Q1427885) (← links)
- A directed hypergraph model for random time dependent shortest paths (Q1569934) (← links)
- An application of Lemke's method to a class of Markov decision problems (Q1610179) (← links)
- Optimal stopping with a probabilistic constraint (Q1695821) (← links)
- Risk-sensitive multiagent decision-theoretic planning based on MDP and one-switch utility functions (Q1718973) (← links)
- Optimal search from multiple distributions with infinite horizon (Q1787340) (← links)
- Computation tree measurement language (CTML) (Q1798671) (← links)
- Dynamic shortest path in stochastic dynamic networks: Ship routing problem (Q1869695) (← links)
- Policy iteration type algorithms for recurrent state Markov decision processes (Q1886500) (← links)
- A simple ant colony optimizer for stochastic shortest path problems (Q1945168) (← links)
- Perseverance and suspense in tug-of-war (Q2050984) (← links)
- Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights (Q2108190) (← links)
- Probabilistic causes in Markov chains (Q2147196) (← links)
- Computing transience bounds of emergency call centers: a hierarchical timed Petri net approach (Q2165235) (← links)
- The stochastic shortest path problem: a polyhedral combinatorics perspective (Q2183321) (← links)
- Wasserstein distributionally robust shortest path problem (Q2301929) (← links)
- On the fastest finite Markov processes (Q2326015) (← links)
- The stochastic shortest-path problem for Markov chains with infinite state space with applications to nearest-neighbor lattice chains (Q2392790) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- Error bounds for stochastic shortest path problems (Q2408892) (← links)
- Stochastic shortest path problems with associative accumulative criteria (Q2425975) (← links)
- PageRank optimization by edge selection (Q2449060) (← links)
- Concurrent reachability games (Q2465027) (← links)
- SPAR: Stochastic Programming with Adversarial Recourse (Q2494826) (← links)
- On the convergence of reinforcement learning with Monte Carlo exploring starts (Q2665181) (← links)
- An approach to the distributionally robust shortest path problem (Q2668652) (← links)
- Nearly Optimal Verifiable Data Streaming (Q2798786) (← links)
- A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times (Q2875605) (← links)
- Computational Methods for Risk-Averse Undiscounted Transient Markov Models (Q2875608) (← links)
- A Tutorial on Interactive Markov Chains (Q2937729) (← links)
- Markov Reward Models and Markov Decision Processes in Discrete and Continuous Time: Performance Evaluation and Optimization (Q2937736) (← links)
- Symbolic Minimum Expected Time Controller Synthesis for Probabilistic Timed Automata (Q2945592) (← links)
