Computer Science Department
School of Computer Science, Carnegie Mellon University
Statistical Selection Among Problem-Solving Methods
We formalize the statistical problem involved in selecting an efficient problem-solving method, derive a solution to this problem, and describe a selection algorithm. The algorithm not only chooses among available methods, but also decides when to abandon the chosen method, if it proves to take too much time. We extend our basic statistical technique to account for problem sizes and for similarity between problems.
We give empirical results of the use of this technique to select among search engines in the Prodigy system. We also test the selection technique on artificially generated performance data, using several different probability distributions.