A gold-mining problem. Optimal backup strategy in computer programs (Q2711571)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1591169
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A gold-mining problem. Optimal backup strategy in computer programs |
scientific article; zbMATH DE number 1591169 |
Statements
2000
0 references
dynamic programming
0 references
sequential strategy
0 references
gold-mining problem
0 references
A gold-mining problem. Optimal backup strategy in computer programs (English)
0 references
This paper offers another approach to the problem of finding an optimal sequential backup strategy tackled by the second author [J. Oper. Res. Soc. Japan 42, 457--470 (1999; Zbl 0998.90083)]. This problem, related to a programming job on a computer, can also be viewed as a special case of R. Bellman's gold-mining problem (1957) approached initially by dynamic programming. The authors derive an optimal strategy and next extend their methodology to cover the case when probability parameter \(p\) is unknown by means of a Bayesian approach.
0 references
0.8352983593940735
0 references
0.7192269563674927
0 references
0.7017766237258911
0 references
0.6924080848693848
0 references
0.6924080848693848
0 references
