๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A factoring approach for the stochastic shortest path problem

โœ Scribed by Kelly J. Hayhurst; Douglas R. Shier

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
473 KB
Volume
10
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Iterative methods for dynamic stochastic
Iterative methods for dynamic stochastic shortest path problems
โœ Raymond K. Cheung ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 147 KB ๐Ÿ‘ 1 views

We consider a routing policy that forms a dynamic shortest path in a network with independent, positive and discrete random arc costs. When visiting a node in the network, the costs for the arcs going out of this node are realized, and then the policy will determine which node to visit next with the

State space partitioning methods for sto
State space partitioning methods for stochastic shortest path problems
โœ Alexopoulos, Christos ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 150 KB ๐Ÿ‘ 2 views

This paper describes methods for computing measures related to shortest paths in networks with discrete random arc lengths. These measures include the probability that there exists a path with length not exceeding a specified value and the probability that a given path is shortest. The proposed meth