Abstract:
The competitive nature of most algorithmic experimentation is a source of problems that are all too familiar to the research community. It is hard to make fair comparisons between algorithms and to assemble realistic test problems. Competitive testing tells us which algorithm is faster but not why. Because it requires polished code, it consumes time and energy that could be spent doing more experiments. This paper argues that a more scientific approach of controlled experimentation, similar to that used in other empirical sciences, avoids or alleviates these problems. We have confused research and development; competitive testing is suited only for the latter. Most experimental studies of heuristic algorithms resemble track meets more than scientific endeavors. Typically an investigator has a bright idea for a new algorithm and wants to show that it works better, in some sense, than known algorithms. This requires computational tests, perhaps on a standard set of benchmark p...
Citations
|
466
|
Where the really hard problems are
– Cheeseman, Kanefsky, et al.
- 1991
|
|
184
|
Experimental results on the cross-over point in satisfiability problems
– Crawford, Auton
- 1993
|
|
178
|
Hard and easy distributions of SAT problems
– MITCHELL, SELMAN, et al.
- 1992
|
|
109
|
Interior point methods for linear programming: computational state of the art
– Lustig, Marsten, et al.
- 1994
|
|
64
|
Needed: An empirical science of algorithms
– Hooker
- 1994
|
|
64
|
Branching rules for satisfiability
– Hooker, Vinay
- 1995
|
|
54
|
The TSP Phase Transition
– Gent, Walsh
- 1996
|
|
44
|
Branch-and-cut solution of inference problems in propositional logic
– Hooker, Fedjki
- 1990
|
|
39
|
Evidence for a satisfiability threshold for random 3CNF formulas
– Larrabee, Tsuji
- 1992
|
|
28
|
Toward an experimental method for algorithm simulation
– McGeoch
- 1996
|
|
26
|
A computational study of satisfiability algorithms for propositional logic
– Harche, Hooker, et al.
- 1994
|
|
24
|
Recognizing disguised NR(1) instances of the satisfiability problem
– Aspvall
- 1980
|
|
13
|
On renamable Horn and generalized Horn functions
– Chandru, Coullard, et al.
- 1990
|
|
4
|
Report on a SAT competition
– Bohm
- 1992
|
|
2
|
Detecting extended Horn structure
– Chandru, Hooker
- 1992
|