𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Infinite-horizon scheduling algorithms for optimal search for hidden objects

✍ Scribed by Levner, E


Book ID
122153033
Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
655 KB
Volume
1
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Optimal search for one of many objects h
✍ Ariela Sharlin πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 621 KB

A discrete search model for one of many objects hidden in two boxes is studied. The number of objects is assumed to be a random variable with a known prior distribution. When box i is searched, a cost ci > 0 is paid and the conditional probability of finding a specific object given it was hidden the