Abstract
Algorithmic experiments come in all sizes. A jumbo testbed for the Traveling Salesman Problem, for instance, can take years to build, and additional years can be spent designing and running insightful experiments. This talk concentrates on tiny algorithmic experiments that can be conducted in a few minutes. Such experiments include parameter estimation, hypothesis testing, determining functional forms, and conducting horse races. This talk also describes how tiny Math, Science and Engineering (MSE) can be done in one’s head or on the back of the proverbial envelope, and shows how to apply it to professional problems and problems in everyday life.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bentley, J. (2006). Tiny Experiments for Algorithms and Life. In: Àlvarez, C., Serna, M. (eds) Experimental Algorithms. WEA 2006. Lecture Notes in Computer Science, vol 4007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11764298_16
Download citation
DOI: https://doi.org/10.1007/11764298_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34597-8
Online ISBN: 978-3-540-34598-5
eBook Packages: Computer ScienceComputer Science (R0)