The performance of several sequential procedures for the following multiple-decision problem is investigated. Samples from k random processes (or populations) are available, k at a time (one from each process), to a receiver or data processor. One process contains a signal; the other k - 1 are statistically identical noise. The receiver is to select the odd process (locate the signal), with prescribed probability of error. The optimal receiver makes the selection in minimum average time. Analytical and Monte Carlo computations were performed under the hypothesis that the processes sampled are Rayleigh; however, a method for extrapolating results to other cases is given. The parameter k is allowed to vary from 2 to 1000.
On the Performance of Some Sequential Multiple-Decision Procedures
IEEE Transactions on Aerospace and Electronic Systems ; AES-7 , 5 ; 906-913
1971-09-01
1946868 byte
Article (Journal)
Electronic Resource
English
Sequential decision rules for a multiple choice problem
TIBKAT | 1966
|Learning of Sequential Procedures in Monkeys
British Library Conference Proceedings | 1996
|Decision procedures for pipeline rehab
Tema Archive | 1989
|Understanding and applying sequential analysis to TPS acceptance test procedures
Tema Archive | 1986
|