Interrogation Scheduling Algorithms for a Discrete Address Beacon System.

Abstract

The report describes several scheduling algorithms that may form part of the interrogation management function of a discrete address beacon system. These include scheduling algorithms that can handle unequal message lengths and types which can schedule a message very rapidly (dynamic scheduling). The algorithms are evaluated in terms of the computation required to execute them and their packing efficiencies. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 17, 1973
Accession Number
AD0770148

Entities

People

  • A. D. Kaminsky
  • A. Spiridon

Organizations

  • Massachusetts Institute of Technology

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Beacons
  • Computational Complexity
  • Computations
  • Discrete Address Beacon Systems
  • Efficiency
  • Interrogation
  • Mathematical Analysis
  • Mathematics
  • Scheduling (Production)

Fields of Study

  • Computer science

Readers

  • Business Analytics
  • Computer Networking
  • Graph Algorithms and Convex Optimization.