Text

A Guide to Experimental Algorithmics

---

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.

---

Availability

No copy data

Detail Information

Series Title

-

Call Number

-

Publisher

: Cambridge University Press., 2012

Collation

-

Language

English

ISBN/ISSN

9780511843747

Classification

NONE

Content Type

text

Media Type

computer

Carrier Type

online resource

Edition

-

Subject(s)

Computer Science,
Software Engineering and Development
Computational Geometry,

Specific Detail Info

-

Statement of Responsibility

Catherine C. McGeoch

Other Information

Cataloger

Arin

Source

-

Validator

maya

Digital Object Identifier (DOI)

https://doi.org/10.1017/CBO9780511843747

Journal Volume

-

Journal Issue

-

Subtitle

-

Parallel Title

-

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment