A theoretician's guide to the experimental analysis of algorithms Export

@misc{citeulike:500195, abstract = {This paper presents an informal discussion of issues that arise when one attempts to analyze algorithms experimentally. It is based on lessons learned by the author over the course of more than a decade of experimentation, survey paper writing, refereeing, and lively discussions with other experimentalists. Although written from the perspective of a theoretical computer scientist, it is intended to be of use to researchers from all fields who want to study algorithms experimentally. It has two...}, author = {Johnson, D.}, citeulike-article-id = {500195}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.1550}, keywords = {algorithms}, posted-at = {2006-02-11 03:26:36}, priority = {3}, title = {A theoretician's guide to the experimental analysis of algorithms}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.1550}, year = {1996} }

TY - GEN ID - citeulike:500195 L3 - citeulike-article-id:500195 N2 - This paper presents an informal discussion of issues that arise when one attempts to analyze algorithms experimentally. It is based on lessons learned by the author over the course of more than a decade of experimentation, survey paper writing, refereeing, and lively discussions with other experimentalists. Although written from the perspective of a theoretical computer scientist, it is intended to be of use to researchers from all fields who want to study algorithms experimentally. It has two... TI - A theoretician's guide to the experimental analysis of algorithms KW - algorithms AU - Johnson, D PY - 1996/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.1550 ER -