𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On theory and algorithms for Markov decision problems with the total reward criterion

✍ Scribed by J. A. E. E. van Nunen; J. Wessels

Publisher
Springer
Year
1979
Tongue
German
Weight
988 KB
Volume
1
Category
Article
ISSN
0171-6468

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimal strategy of route and look for t
Optimal strategy of route and look for the path constrained search problem with reward criterion
✍ Ryusuke Hohzaki; Koji Iida πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 741 KB

A target is moving among a finite number of cells K= {1 ..... K} in discrete time T= {1 ..... T}. Knowing the probability of the target's path selection, a searcher is searching for the target with constraints that he can move from cell i to one of the adjacent cells l(i). The searcher detects the t

2-Approximation algorithms for the multi
2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times
✍ Yoshiyuki Karuno; Hiroshi Nagamochi πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 180 KB

In this paper, given a path G with n vertices v1; v2; : : : ; vn and m identical vehicles, we consider a scheduling problem of the vehicles on the path. Each vertex vj in G has exactly one job j. Any of the n jobs must be served by some vehicle. Each job j has a release time rj and a handling time h