AN EVALUATION OF HEURISTICS FOR THRESHOLD-FUNCTION TEST-SYNTHESIS,

Abstract

Linear programming offers the most attractive procedure for testing and obtaining optimal threshold gate realizations for functions generated in theoretical work, where the number of arguments ranges from 7 to 12, and the problem is to be solved by hand calculations. Certain initial reduction steps are known to be effective in reducing the number of column manipulations needed. A series of computer experiments were devised to evaluate their relative efficacy. The experiments also demonstrated the relative merits of several different values of pivot-choice; a new 'pair-pivot' rule proved best in the most general case. Other experiments were run which gave additional heuristic insight into the operation of this family of linear programs. The design of the experiments may be of general interest to students of automatic problem solving; the results should be of interest in threshold logic and linear programming. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 01, 1968
Accession Number
AD0670556

Entities

People

  • Robert O. Winder

Organizations

  • RCA Corporation

Tags

DTIC Thesaurus Topics

  • Applied Mathematics
  • Automatic
  • Computer Programming
  • Computers
  • Convex Programming
  • Interdisciplinary Science
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Operations Research
  • Test And Evaluation

Readers

  • Computer Engineering
  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design