Balakirsky, S.
and Kramer, T.
(2004),
Comparing Algorithms: Rules of Thumb and an Example, 2004 Performance Metrics for Intelligent Systems (PerMIS) Workshop, Gaithersburg, MD, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=822550
(Accessed May 19, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Comparing Algorithms: Rules of Thumb and an Example
Published
Author(s)
,
Abstract
This paper provides twenty rules of thumb for comparing algorithms having the same function, one of which is to be selected for use in an intelligent system. The rules are illuminated by a specific example, the comparison of three algorithms for dealing with the collection of open nodes that is at the heart of the Dijkstra graph search method. For each rule, a description is given of how the rule was applied in building the example.Conference Dates
August 24-26, 2004
Conference Location
Gaithersburg, MD
Conference Title
2004 Performance Metrics for Intelligent Systems (PerMIS) Workshop
Pub Type
Conferences
Download Paper
Keywords
algorithm, binary tree, compare, Dijksta, graph, jump search, list, Performance Metrics, run time, search, Software Engineering
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created August 24, 2004, Updated February 17, 2017