Kontaktujte nás | Jazyk: čeština English
Název: | Pareto-based Self-Organizing Migrating Algorithm solving 100-Digit Challenge | ||||||||||
Autor: | Truong, Thanh Cong; Diep, Quoc Bao; Zelinka, Ivan; Šenkeřík, Roman | ||||||||||
Typ dokumentu: | Článek ve sborníku (English) | ||||||||||
Zdrojový dok.: | Communications in Computer and Information Science. 2020, vol. 1092 CCIS, p. 13-20 | ||||||||||
ISSN: | 1865-0929 (Sherpa/RoMEO, JCR) | ||||||||||
Journal Impact
This chart shows the development of journal-level impact metrics in time
|
|||||||||||
ISBN: | 978-3-03-037837-0 | ||||||||||
DOI: | https://doi.org/10.1007/978-3-030-37838-7_2 | ||||||||||
Abstrakt: | In this article, we describe the design and implementation of a variant version of SOMA named SOMA Pareto to solve ten hard problems of the 100-Digit Challenge. The algorithm consists of the following operations: Organization, Migration, and Update. In which, we focus on improving the Organization operation with the adaptive parameters of PRT and Step. When applying the SOMA Pareto to solve ten hard problems to 10 digits of accuracy, we achieved a competitive result: 85.04 points. © Springer Nature Switzerland AG 2020. | ||||||||||
Plný text: | https://link.springer.com/chapter/10.1007/978-3-030-37838-7_2 | ||||||||||
Zobrazit celý záznam |