Comparing Algorithms: Rules of Thumb and an Example

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 2004
Accession Number
ADA522948

Entities

People

  • S. Balakirsky
  • T. R. Kramer

Organizations

  • National Institute of Standards and Technology

Tags

Communities of Interest

  • Autonomy

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Computer Science
  • Artificial Intelligence
  • Commercial Equipment
  • Compilers
  • Computer Languages
  • Computer Programs
  • Computer Science
  • Computers
  • Functional Analysis
  • Intelligent Systems
  • Language
  • Measurement
  • Operating Systems
  • Standards
  • Trees (Data Structures)

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Artificial Intelligence
  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.