Cybernetics

, Volume 9, Issue 2, pp 193–196 | Cite as

An applied problem of discrete programming

  • V. P. Koryachko
Article
  • 11 Downloads

Keywords

Operating System Artificial Intelligence System Theory Applied Problem Discrete Programming 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    A. S. Nikitin, “Optimal distribution and choice of the number of registers in a digital computer by means of integer linear programming,” in: Problems of Theoretical Cybernetics, [in Russian], Naukova Dumka, Kiev (1965).Google Scholar
  2. 2.
    V. P. Koryachko and Yu. M. Korshunov, “On a formal choice of structures of digital automatic devices,” in: Theory of Automata and Methods of Formalized Synthesis of Computing Machines and Systems [in Russian], No. 3, Izd. IK AN USSR, Kiev (1968).Google Scholar
  3. 3.
    O. Lange, Optimal Decisions, Pergamon (1970).Google Scholar
  4. 4.
    C. Berge, The Theory of Graphs and Its Applications [Russian translation], IL, Moscow (1962).Google Scholar
  5. 5.
    Yu. M. Korshunov and V. P. Koryachko, “The working out of preferences when assessing apparatus for statistical analysis of random processes,” Proceedings of the 2nd All-Union Symposium “Methods of Representation and Apparatus Analysis of Random Processes and Fields” [in Russian], Novosibirsk (1969).Google Scholar
  6. 6.
    F. R. Gantmacher, Theory of Matrices [Russian translation], Nauka, Moscow (1967).Google Scholar

Copyright information

© Plenum Publishing Coropration 1975

Authors and Affiliations

  • V. P. Koryachko

There are no affiliations available

Personalised recommendations