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.

UDC: 519


Received: 10.05.1976

 English version: Automation and Remote Control, 1977, 38:5, 721–732

Bibliographic databases:

• 
•