| Autor: |
Schlesinger, M. I., Antoniuk, K. V. |
| Předmět: |
|
| Zdroj: |
Cybernetics & Systems Analysis; Mar2011, Vol. 47 Issue 2, p175-192, 18p |
| Abstrakt: |
formal analysis of so-called diffusion algorithms is performed. They are frequently used in structural recognition but are rather poorly theoretically studied. These algorithms are analyzed from the viewpoint of their ability to optimize a function of many discrete variables, which is represented as the sum of many terms each of which depends on only two variables. It is proved that, under some stop condition, a diffusion algorithm approximately solves certain subclasses of optimization problems with any predefined nonzero error. The totality of problems solved by diffusion algorithms includes all so-called acyclic and supermodular optimization problems and also some other problems for which solution algorithms are unknown. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink