| DC Field | Value | Language |
|---|
| dc.contributor.author | Astrowski, V. A. | - |
| dc.coverage.spatial | Минск | en_US |
| dc.date.accessioned | 2026-07-16T08:09:18Z | - |
| dc.date.available | 2026-07-16T08:09:18Z | - |
| dc.date.issued | 2026 | - |
| dc.identifier.citation | Astrowski, V. A. Genetic algorithms: how computers «evolve» / V. A. Astrowski // Электронные системы и технологии : сборник материалов 62-й научной конференции аспирантов, магистрантов и студентов БГУИР, Минск, 13–17 апреля 2026 г. / Белорусский государственный университет информатики и радиоэлектроники ; редкол.: П. В. Камлач [и др.]. – Минск, 2026. – С. 1051–1053. | en_US |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/64676 | - |
| dc.description.abstract | This article discusses the principles of genetic algorithms and the types of problems they are designed to solve. It describes their operating mechanisms, including selection, crossover and mutation, and analyses their advantages over traditional mathematical methods in solving complex optimisation tasks. A practical implementation of the OneMax problem is presented to illustrate the algorithm’s functionality. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | БГУИР | en_US |
| dc.subject | материалы конференций | en_US |
| dc.subject | genetic algorithms | en_US |
| dc.subject | crossovers | en_US |
| dc.subject | mutation | en_US |
| dc.subject | genes | en_US |
| dc.subject | artificial intelligence | en_US |
| dc.title | Genetic algorithms: how computers «evolve» | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Электронные системы и технологии : материалы 62-й конференции аспирантов, магистрантов и студентов (2026)
|
