(Enter summary)
Abstract: this article goes to
press. Journal editors can be encouraged to seek out referees who have done rigorous empirical
studies. Refereeing standards will evolve, particularly as the empirical science develops. (Update)
Cited by: More
Fundamenta Informaticae 68 (2005) 47--102 47 IOS Press - Calculus Of Bounded
(Correct)
Experiments with Local Search on Random 2+p-SAT - Singer, Gent, Smaill (2000)
(Correct)
Dijkstra's Algorithm On-Line: An Empirical Case Study from .. - Schulz, Wagner, Weihe (2000)
(Correct)
Active bibliography (related documents): More All
1.0: Branching Rules for Satisfiability - Hooker, Vinay (1995)
(Correct)
0.5: A Bibliography of Algorithm Experimentation - McGeoch (1999)
(Correct)
0.5: A New Technique for Generating Quadratic Programming.. - Calamai, Vicente.. (1993)
(Correct)
Similar documents based on text: More All
0.1: Integration of Constraint Programming and Integer Programming.. - Ottosson (2000)
(Correct)
0.1: Critical Principles: On the Negative Side of Rationality - Bickhard (1989)
(Correct)
0.0: Partial Instantiation Methods for Inference in First.. - Hooker, Rago.. (2000)
(Correct)
Related documents from co-citation: More All
11: Testing Heuristics: We Have It All Wrong
- Hooker - 1996
11: Where the really hard problems are
- Cheeseman, Kanefsky et al. - 1991
10: Hard and easy distributions of sat problems
- Mitchell, Selman et al. - 1992
BibTeX entry: (Update)
J.N. Hooker. Needed: an empirical science of algorithms. Operations Research, 42(2):201 212, March-April 1994. http://citeseer.ist.psu.edu/hooker94needed.html More
@misc{ hooker94needed,
author = "J. Hooker",
title = "Needed: an empirical science of algorithms",
text = "J.N. Hooker. Needed: an empirical science of algorithms. Operations Research,
42(2):201 212, March-April 1994.",
year = "1994",
url = "citeseer.ist.psu.edu/hooker94needed.html" }
Citations (may not include all citations):
4212
Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey - 1979
643
Equation of state calculations by fast computing machines (context) - Metropolis, Rosenbluth et al. - 1953
312
Tabu search---Part (context) - Glover - 1989
174
Tabu search---Part II (context) - Glover
93
Simulated Annealing and Boltzmann Machines: A Stochastic App.. (context) - Aarts - 1989
64
Solving propositional satisfiability problems (context) - Jeroslow - 1990
43
Tabu search: A tutorial (context) - Glover
43
An empirical analysis of search in GSAT
- Gent - 1993
32
On self-organizing sequential search heuristics (context) - Rivest - 1976
31
Branching rules for satisfiability
- Hooker - 1993
27
Conjectures and Refutations (context) - Popper - 1965
26
The average-case analysis of some on-line algorithms for bin.. (context) - Shor - 1984
23
Analyzing algorithms by simulation: variance reduction techn.. (context) - McGeoch - 1992
21
A computational study of satisfiability algorithms for propo.. (context) - Harche, Hooker et al. - 1993
20
A new convex hull algorithm for planar sets (context) - Eddy - 1977
20
Convergence and finitetime behavior of simulated annealing (context) - Mitra, Romeo et al. - 1986
19
Fiction and Forecast (context) - Goodman - 1965
16
Artificial life: The coming evolution (context) - Farmer - 1990
14
the probabilistic performance of algorithms for the satisfia..
- Franco - 1986
13
Scientific Computation on Mathematical Problems and Conjectu.. (context) - Varga - 1990
12
Empirical analysis of heuristics (context) - Golden - 1985
12
The depth and width of local minima in discrete solution spa.. (context) - Ryan
11
Experimental analysis of algorithms (context) - McGeoch
10
Some unexpected expected-behavior results for bin packing (context) - Bentley, Johnson et al. - 1984
10
An experimental study of bin packing (context) - Bentley, Johnson et al. - 1983
7
Optimal sampling strategies for quicksort (context) - McGeoch - 1991
6
A survey of average time analyses of satisfiability algorith.. (context) - Purdom - 1990
5
Experiments on the running time behaviour of some algorithms.. (context) - Mitterreiter - 1993
5
Simulations of dynamic sequential search algorithms (context) - Tenenbaum - 1978
3
Probabilistic methods with heaps for fastaverage -case greed.. (context) - Manacher - 1983
3
The death of proof (context) - Horgan - 1993
2
Testing strategies for simulation optimization (context) - Barton - 1987
2
Controlled experimental design for statistical comparison of.. (context) - Lin - 1980
2
Reporting computational experiments in mathematical programm.. (context) - Crowder, Dembo et al. - 1978
2
A variable-depth-search heuristic for the generalized assign.. (context) - Amini - 1992
1
An experimental study of median-selection in quicksort (context) - McGeoch
1
Assessing the performance of the simulating annealing algori.. (context) - Fleischer - 1993
1
A foundational concept of science appropriate for validation.. (context) - Miser - 1993
1
The entropy of inhomogeneous Markov chains with applications.. (context) - Fleischer - 1992
1
The depth and width of local minima for graph coloring probl.. (context) - Ryan
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.gsia.cmu.edu/afs/andrew/gsia/jh38/papers.htm): More
Mixed Logical/Linear Programming - Hooker, Osorio (1996)
(Correct)
Solving the Incremental Satisfiability Problem - Hooker (1992)
(Correct)
Predicting Cause-Effect Relationships from Incomplete.. - Boros, Hammer, Hooker (1991)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC