How to Present a Paper on Experimental Work with Algorithms (1999) [7 citations — 1 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Catherine C. Mcgeoch and Bernard M. E. Moret},
title = {How to Present a Paper on Experimental Work with Algorithms},
booktitle = {DIMACS: Series in Discrete Mathematics and Theoretical Computer Science},
year = {1999}
}
Bookmarks
OpenURL
Abstract:
Inspired by Ian Parberry's \How to present a paper in theoretical computer science," (SIGACT News 19, 2 (1988), pp. 42-47), we provide some advice on how to present results from experimental and empirical research on algorithms. 1 Introduction This note is written primarily for researchers in algorithms who nd themselves called upon to present the results of computational experiments. While there has been much recent growth in the amount and quality of experimental research on algorithms, there is still some uncertainty about how to describe the research and present the conclusions. For general advice on presenting papers in theoretical computer science, read Ian Parberry 's excellent paper [6]. Here we focus on aspects directly relevant to experimentation and data analysis. Of course, the quality of the talk depends on the quality of the research. For advice on conducting respectable experimental research on algorithms, read McGeoch [5], or Barr et al. [1], or the articles on m...
Citations
| 180 | The Elements of Graphing Data – Cleveland - 1985 |
| 151 | Graphic Methods for Data Analysis – Chambers, Cleveland, et al. - 1983 |
| 88 | W.R.: Designing and reporting computational experiments with heuristic methods – Barr, Golden, et al. - 1995 |
| 28 | Toward an experimental method for algorithm simulation – McGeoch - 1996 |
| 8 | How to present a paper in theoretical computer science: A speaker's guide for students – Parberry - 1989 |
| 1 | Draft methodology papers are available at the website www.cs.amherst.edu/~dsj/methday.html – Johnson, McGeoch, et al. - 2000 |
