This is a preview. Log in through your library . Abstract In an infinite sequence of independent Bernoulli trials with success probabilities p k = a/(a + b + k — 1) for k = 1, 2, 3,..., let N r be the ...
Given a sequence of N independent trials, we want to find an optimal strategy which maximizes the probability of selecting the last record with recall of length m (m > 1). We use the idea of pattern ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback