Search by:
Year of publication
Author name
Paper title
On the nature of finite end infinite of combinatorial sets
Full text (PDF)
UDC: 519.14
Publication Language: Ukrainian
Stuc. intelekt. 2017; 22(2):109-118
Abstract: Some properties of combinatorial configurations and their sets are explored. It is shown that depending on the applied problems of combinatorial optimization, they can be finite and infinite, both with repetitions and without repetitions. In artificial intelligence, combinatorial configurations can be both input data and argument of objective function.
Keywords: combinatorial set, combinatorial configuration, argument of objective function, partitioning n-element set into subsets, selections, clusterization, classification.
References:
- Holl M.X. Kombinatorika / M.X. Holl [per. z anhl. pid red. A.O. Gelfonda]. – M.: Mir, 1970. – 423 s.
- Rybnikov К.А. Vvedenie v kombinatornyj analiz / К. А. Rybnikov. – М.: Izd-vo Моskov. un-та, 1985. – 308 s.
- Rejngold E. Комbinatornye аlgoritmy. Теоrija i praktika / E. Rejngold, Yu. Nivergelt, N. Deo [per. zanhl. pid red. V.B. Аlekseeva]. – М.: Мir, 1980. – 476 s.
- Lipskij V. Kombinatorika dlja programistov / V. Lipskij [per. z polsk.]– М. Мir, 1988.– 213 s.
- Кurosh А.G. Кurs vysshej algebry. – М.: Nauka, 1968. – 431 s.
- Frid E. Elementarnoe vvedenie v abstraktnuju algebru / E.Frid [per. z anhl.]– М.: Мir. 1979. – 230 s.
- Endrus G. Teoryja razbienij / G. Endrus.[per. z anhl.]. – М.: Наука, 1982.– 276 s.
- Tymofijeva N.K. Teoretyko-thyslovi metody rozvjazannja zadath kombinatornoji optymizatsji. Avtoref/dys…dokt/ texn/ nauk / In-t kibernetyky im. V.M. Glushkova NAN Ukrajiny, Kyjiv. – 2007/ – 32 s.
- Komyak V.V. Obtaining the Local Extremum in the Problem of Covering the Fields by the Circles ofVariable Radius / V.V, Komyak, V.M. Komyak, A.V. Pankratov, A.Yu. Prikodko // USiM. – 2016.–№2. – P. 22–27.