Online Selection Algorithm
In certain selection problems, selection must be online, that is, an element can only be selected from a sequential input at the instance of observation and each selection, respectively refusal, is irrevocable. The problem is to select, under these constraints, a specific element of the input sequence (as for example the largest or the smallest value) with largest probability. This problem can be tackled by the Odds algorithm designed by F. Thomas Bruss who coined the name Odds algorithm. It is also known as Bruss-algorithm or Bruss-strategy. This algorithm yields the optimal under an independence condition; it is also optimal itself as an algorithm with the number of computations being linear in the length of input.
Read more about this topic: Selection Algorithm
Famous quotes containing the word selection:
“When you consider the radiance, that it does not withhold
itself but pours its abundance without selection into every
nook and cranny”
—Archie Randolph Ammons (b. 1926)