Download

Download Free Electronic Document

FormatFile SizeNotes
PDF file 0.1 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.

Purchase

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback10 pages $15.00 $12.00 20% Web Discount

A discussion of a problem, solved iteratively in a previous study, of finding an optimal sequence of word transfers on a serial memory drum. This paper presents an improved method that requires only a few simple adjustments after the initial trial sequence is formed. Mathematically it is of interest in that it is a special form of a traveling-salesman-type problem that can be easily solved.

This report is part of the RAND Corporation paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.