An entropy estimate for the problem of location of ones in a binary matrix
Article
Received:
- 23 Downloads
Keywords
Entropy Operating System Artificial Intelligence System Theory Binary Matrix
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.
Literature Cited
- 1.A. G. Wilson, Entropy in Urban and Regional Modeling, Academic Press (1970).Google Scholar
- 2.I. V. Romanovskii and N. P. Khristova, “Solution of discrete problems by the dichotomy method,” Zh. Vychisl. Mat. Mat. Fiz.,13, No. 5, 1200–1209 (1973).Google Scholar
- 3.V. V. Shkurba and S. A. Beletskii, “Numerical methods for solving the assembly-line balancing problem,” Kibernetika, No. 1, 96–108 (1977).Google Scholar
- 4.S. B. Katsev, “On a class of discrete minimax problems,” Kibernetika, No. 5, 139–141 (1979).Google Scholar
- 5.M. Marcus and H. Minc, A Survey of Matrix Theory and Matrix Inequalities [Russian translation], Nauka, Moscow (1972).Google Scholar
- 6.E. G. Gol'shtein and D. B. Yudin, New Trends in Linear Programming [in Russian], Sovetskoe Radio, Moscow (1966).Google Scholar
- 7.L. R. Ford, Jr., and D. R. Fulkerson, Flows in Networks, Princeton University Press (1972).Google Scholar
Copyright information
© Plenum Publishing Corporation 1984