Speed-Efficiency-Complexity Tradeoffs in Universal Diagnosis Algorithms

Abstract

Expressions are derived for the average number of steps required (speed) and the average number of fault-free units replaced (efficiency) when universal diagnosis algorithms are applied to systems of various degrees of interconnection (complexity). Specifically, two algorithms proposed by Smith [4] are considered. It is shown, for example, that there is a clear tradeoff between the two algorithms; one is much faster, while the other is more efficient.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1981
Accession Number
ADA605513

Entities

People

  • Jon T. Butler

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computer Programs
  • Computer Science
  • Computers
  • Efficiency
  • Electrical Engineering
  • Engineering
  • Information Operations
  • Mathematics
  • Schools
  • Universities

Fields of Study

  • Computer science
  • Engineering

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.