|
Avtomatika i Telemekhanika, 1977, Issue 5, Pages 127–139
(Mi at7362)
|
|
|
|
Simulation of Behavior and Intelligence
Iterative procedures for finding agglomerations of subsets
B. M. Litvakov Moscow
Abstract:
In many scientific and practical fields agglomerations of subsets or the stable part of decomposition of some set shoult be found; these two problems are stated in strict terms. A recurrence algorithm is put forward and its convergence proved. The problem of finding agglomerations of subsets is shown to be related to that of complete package formation.
Received: 10.05.1976
Citation:
B. M. Litvakov, “Iterative procedures for finding agglomerations of subsets”, Avtomat. i Telemekh., 1977, no. 5, 127–139; Autom. Remote Control, 38:5 (1977), 721–732
Linking options:
https://www.mathnet.ru/eng/at7362 https://www.mathnet.ru/eng/at/y1977/i5/p127
|
Statistics & downloads: |
Abstract page: | 96 | Full-text PDF : | 37 |
|