Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Marcin M. Komarnicki"'
Publikováno v:
Proceedings of the Genetic and Evolutionary Computation Conference.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d8b4861a2549381e413a3425c5a52b7
https://doi.org/10.1145/3512290.3528734
https://doi.org/10.1145/3512290.3528734
Publikováno v:
GECCO Companion
Linkage learning techniques are a crucial part of many modern evolutionary methods dedicated to solving problems in discrete domains. Linkage information quality is decisive for the effectiveness of these methods. In this article, we point on two pos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8463e7d99081b769f46fa5fe022a1390
https://doi.org/10.1109/tevc.2020.2985497
https://doi.org/10.1109/tevc.2020.2985497
Autor:
Piotr Lechowicz, Arunabha Sen, Michał Witold Przewoźniczek, Krzysztof Walkowiak, Marcin M. Komarnicki
Publikováno v:
Information Sciences. 479:1-19
Evolutionary methods are well-known tools used for solving hard computational problems. In this paper, we consider k-Shortest Steiner Trees (kSST) problem appearing in a diverse set of domains, e.g., multicast tree construction in communication netwo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8f08ce3d63d7b4ee82675b37a450d045
https://doi.org/10.1016/j.ins.2018.11.015
https://doi.org/10.1016/j.ins.2018.11.015
Publikováno v:
CEC
In the field of Evolutionary Computation, the main objective is to find a high-quality solution to the considered problem. However, the other important issue is to find a solution efficiently. Therefore, evolutionary methods use various techniques to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::621dd3bc5547c9d7f47071bfc0594694
https://doi.org/10.1109/cec45853.2021.9504686
https://doi.org/10.1109/cec45853.2021.9504686
Publikováno v:
GECCO
Problem decomposition is an important part of many state-of-the-art Evolutionary Algorithms (EAs). The quality of the decomposition may be decisive for the EA effectiveness and efficiency. Therefore, in this paper, we focus on the recent proposition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1bc8a72b8e4931c5fb5402003dceb41f
https://doi.org/10.1145/3449639.3459333
https://doi.org/10.1145/3449639.3459333
Publikováno v:
GECCO
Linkage learning is frequently employed in modern evolutionary algorithms. High linkage quality may be the key to an evolutionary method's effectiveness. Similarly, the faulty linkage may be the reason for its poor performance. Many state-of-the-art
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f4e5e99118a7960127000dc0ec04864
https://doi.org/10.1145/3377930.3390242
https://doi.org/10.1145/3377930.3390242
Publikováno v:
GECCO
Dependency Structure Matrix Genetic Algorithm-II (DSMGA-II) is a recently proposed optimization method that builds the linkage model on the base of the Dependency Structure Matrix (DSM). This model is used during the Optimal Mixing (OM) operators, su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68f6a55b7eb4143b901d172c75732df4
https://doi.org/10.1145/3377930.3390223
https://doi.org/10.1145/3377930.3390223
Autor:
Piotr Dziurzanski, Marcin M. Komarnicki, Leandro Soares Indrusiak, Shuai Zhao, Michael Przewozniczek
Publikováno v:
Journal of Computational Science
In smart factories, integrated optimisation of manufacturing process planning and scheduling leads to better results than a traditional sequential approach but is computationally more expensive and thus difficult to be applied to real-world manufactu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3751aca2e932c3cc39b77ce0b2cebc06
https://eprints.whiterose.ac.uk/155045/1/JoCS_28th_Feb.pdf
https://eprints.whiterose.ac.uk/155045/1/JoCS_28th_Feb.pdf
Publikováno v:
Parallel Problem Solving from Nature – PPSN XVI ISBN: 9783030581114
PPSN (1)
PPSN (1)
Linkage learning is frequently employed in state-of-the-art methods dedicated to discrete optimization domains. Information about linkage identifies a subgroup of genes that are found dependent on each other. If such information is precise and proper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec88e7e7dc6686ce662ba0e28bca3b0f
https://doi.org/10.1007/978-3-030-58112-1_29
https://doi.org/10.1007/978-3-030-58112-1_29
Publikováno v:
Applied Soft Computing. 113:107864
In this paper, we consider an NP-hard, real-world optimization problem from the field of computer networks. The problem refers to the network survivability and may be considered hard due to its scale. Such problems are usually successfully solved by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6baa9c8eef4bf823c48945002c3bf588
https://doi.org/10.1016/j.asoc.2021.107864
https://doi.org/10.1016/j.asoc.2021.107864