Cluster Approach to the Domains Formation
| dc.creator | Litinskii, Leonid B. | |
| dc.date | 2008-03-26 | |
| dc.date.accessioned | 2026-07-07T09:28:38Z | |
| dc.date.available | 2026-07-07T09:28:38Z | |
| dc.description | As a rule, a quadratic functional depending on a great number of binary variables has a lot of local minima. One of approaches allowing one to find in averaged deeper local minima is aggregation of binary variables into larger blocks/domains. To minimize the functional one has to change the states of aggregated variables (domains). In the present publication we discuss methods of domains formation. It is shown that the best results are obtained when domains are formed by variables that are strongly connected with each other. | |
| dc.description | 11 pages, 5 figures, PDF-file | |
| dc.identifier | https://arxiv.org/abs/0803.3746 | |
| dc.identifier | http://arxiv.org/abs/0803.3746 | |
| dc.identifier | Optical Memory & Neural Networks (Information Optics), 2007, v.16(3) pp.144-153 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/157498 | |
| dc.subject | Neural and Evolutionary Computing | |
| dc.subject | Data Structures and Algorithms | |
| dc.title | Cluster Approach to the Domains Formation | |
| dc.type | text |