Relaxation Applied to Matching Quantitative Relational Structures

Abstract

A relaxation process is applied to the problem of matching relational structures involving numeric quantities. The method is empirically shown to be very sensitive to the exact form of the updating rule used. However, with the proper updating rule, the method works well, and is remarkably tolerant of measurement errors.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1978
Accession Number
ADA071604

Entities

People

  • Les Kitchen

Organizations

  • University of Maryland

Tags

DTIC Thesaurus Topics

  • Cartesian Coordinates
  • Computations
  • Computer Science
  • Computers
  • Fuzzy Logic
  • Iterations
  • Logic
  • Maryland
  • Measurement
  • Night Vision
  • Numbers
  • Perturbations
  • Programming Languages
  • Real Numbers
  • United States
  • Universities

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Database Systems and Applications
  • Molecular Photonics/Laser Physics