## 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
β¦ LIBER β¦
The construction of an optimal distribution of search effort
β Scribed by Ingo Wegener
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 618 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The discrete search problem and the cons
β
Ingo Wegener
π
Article
π
1982
π
John Wiley and Sons
π
English
β 646 KB
Optimal strategies of the search for an
β
A.G. Sukharev
π
Article
π
1971
π
Elsevier Science
β 931 KB
Detection of a Markovian target with opt
β
FrΓ©dΓ©ric Dambreville; Jean-Pierre Le Cadre
π
Article
π
2002
π
John Wiley and Sons
π
English
β 318 KB
Synthesis of fullerenes: An effort to op
β
A. Weston; M. Murthy
π
Article
π
1996
π
Elsevier Science
π
English
β 663 KB
Fullerenes in yields as high as 15 wt% have been synthesized in a flow through reactor assembly employing the contact arc method. The yields are found to be greatly affected by arcing parameters like the flow rate of helium and current. UV radiation emitted during arcing was found to reduce fulleren
The construction of an optimal weakly di
β
Xiu Ye; Charles A. Hall
π
Article
π
1993
π
John Wiley and Sons
π
English
β 847 KB
The construction of an optimal linear th
β
A.I. Zelichenko
π
Article
π
1980
π
Elsevier Science
β 857 KB