Introduction
Experimentation plays an important role in the Algorithm Engineering cycle. It is a powerful tool that amends the traditional and established theoretical methods of algorithm research. Instead of just analyzing the theoretical properties, experiments allow for estimating the practical performance of algorithms in more realistic settings. In other fields related to Computer Science, like for instance Mathematical Programming or Operations Research, experiments have been an indispensable method from the very beginning. Moreover, the results of systematic experimentation may yield new theoretical insights that can be used as a starting point for the next iteration of the whole Algorithm Engineering cycle.
Thereby, a successful experiment is based on extensive planning, an accurate selection of test instances, a careful setup and execution of the experiment, and finally a rigorous analysis and concise presentation of the results. We discuss these issues in this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Berberich, E., Hagen, M., Hiller, B., Moser, H. (2010). Chapter 8. Experiments. In: Müller-Hannemann, M., Schirra, S. (eds) Algorithm Engineering. Lecture Notes in Computer Science, vol 5971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14866-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-14866-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14865-1
Online ISBN: 978-3-642-14866-8
eBook Packages: Computer ScienceComputer Science (R0)