✦ LIBER ✦

Discrete search and the Neyman-Pearson Lemma

✍ Scribed by Joseph B Kadane

Publisher: Elsevier Science
Year: 1968
Tongue: English
Weight: 806 KB
Volume: 22
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(68)90167-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on the Neyman-Pearson’s fundamental

Note on the Neyman-Pearson’s fundamental lemma

✍ Yukio Suzuki 📂 Article 📅 1954 🏛 Springer Japan 🌐 English ⚖ 550 KB

Monotonic expectations, Neyman-Pearson l

Monotonic expectations, Neyman-Pearson lemma, and some properties of the SPRT

✍ Rasul A. Khan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 308 KB

An application of the neyman-pearson lem

An application of the neyman-pearson lemma to gaussian processes

✍ N. K. Bakirov 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 306 KB

Comparison of sequential and Neyman — Pe

Comparison of sequential and Neyman — Pearson criteria in the asymptotic case

✍ A. M. Fal' 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 226 KB

The discrete search problem and the cons

The discrete search problem and the construction of optimal allocations

✍ Ingo Wegener 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 646 KB

## Abstract Suppose one object is hidden in the __k__‐th of __n__ boxes with probability __p__(__k__). The boxes are to be searched sequentially. Associated with the __j__‐th search of box __k__ is a cost __c__(__j,k__) and a conditional probability __q__(__j,k__) that the first __j__ ‐ 1 searches

Application of the adaptive random searc

Application of the adaptive random search to discrete and mixed integer optimization

✍ R. C. Kelahan; J. L. Gaddy 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 527 KB