A discrete theory of search. II
A Less Sensitive Linear Detector for the Change Point Based on Kernel Smoothing Method.
A method of detecting changes in the behaviour of locally stationary sequences
A note on selecting the better binomial population.
An adaptive sequential test
Boundaries for the average length of strategic tests
On minimax sequential estimation of the mean value of a stationary Gaussian Markov process
On the optimum sequential test of two hypotheses for statistically dependent observations
Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem.
Quelques modèles probabilistes sous-jacents à la théorie des tests psychologiques
Sequential classification in the case of many populations
The optimum sequential test of a finite number of hypotheses for statistically dependent observations
The "Thirty-seven Percent Rule" and the secretary problem with relative ranks
We revisit the problem of selecting an item from n choices that appear before us in random sequential order so as to minimize the expected rank of the item selected. In particular, we examine the stopping rule where we reject the first k items and then select the first subsequent item that ranks lower than the l-th lowest-ranked item among the first k. We prove that the optimal rule has k ~ n/e, as in the classical secretary problem where our sole objective is to select the item of lowest rank;...
Последовательный критерий