A Guide to Experimental Algorithmics / Catherine C. McGeoch.
Material type: TextPublisher: Cambridge : Cambridge University Press, 2012Description: 1 online resource (272 pages) : digital, PDF file(s)Content type:- text
- computer
- online resource
- 9780511843747 (ebook)
- 005.1 23
- QA76.9.A43 M385 2012
Title from publisher's bibliographic system (viewed on 04 Apr 2016).
Computational experiments on algorithms can supplement theoretical analysis by showing what algorithms, implementations and speed-up methods work best for specific machines or problems. This book guides the reader through the nuts and bolts of the major experimental questions: What should I measure? What inputs should I test? How do I analyze the data? To answer these questions the book draws on ideas from algorithm design and analysis, computer systems, and statistics and data analysis. The wide-ranging discussion includes a tutorial on system clocks and CPU timers, a survey of strategies for tuning algorithms and data structures, a cookbook of methods for generating random combinatorial inputs, and a demonstration of variance reduction techniques. The book can be used by anyone who has taken a course or two in data structures and algorithms. A companion website, AlgLab (www.cs.amherst.edu/alglab) contains downloadable files, programs and tools for use in experimental projects.
There are no comments on this title.