Accession Number:

AD0631839

Title:

OPTIMAL ASSIGMENT OF COMPUTER STORAGE BY CHAIN DECOMPOSITION OF PARTIALLY ORDERED SETS

Descriptive Note:

Research rept.

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Report Date:

1966-03-01

Pagination or Media Count:

13.0

Abstract:

To save storage, a program is usually written so that each variable assumes several values. As a result, a program is usually difficult to understand and prone to errors. For an important class of programs, it will be shown that they can be written with complete freedom in the naming of variables leaving the task of minimizing storage requirements to the computer itself.

Subject Categories:

  • Operations Research
  • Computer Programming and Software
  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE