Baselines for On-Line Search Methods
Joseph C. Pemberton · 2000
On-line search algorithms have become increasingly important in a wide variety of application domains. Our position is that research in on-line search algo-rithms should at a minimum include experimental re-suits that compare the algorithm’s performance to a reasonable set of baselines. We suggest a general ap-proach to baselines, and then present examples for a particular domain of on-line search problems.