On an application of dynamic programming to the synthesis of logical systems.
Purchase Print Copy
|Add to Cart||Paperback16 pages||$15.00||$12.00 20% Web Discount|
An application of dynamic programming to problems arising in the synthesis of logical systems. In a number of fields a system in one state must be optimally converted into another state (e.g., in mathematical economics, in the theory of control processes, in network theory, and in trajectory processes). The present study considers a type of question occurring in the design of computers and switching circuits. The problem is treated in general terms, and a special example is given to illustrate the methods.
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.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
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.