Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Komarnicki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Marcin Michal Komarnicki
, Michal Witold Przewozniczek, Halina Kwasnicka, Krzysztof Walkowiak:
Incremental Recursive Ranking Grouping for Large-Scale Global Optimization. IEEE Trans. Evol. Comput. 27(5): 1498-1513 (2023)- [c19]Marcin Michal Komarnicki, Michal Witold Przewozniczek, Halina Kwasnicka, Krzysztof Walkowiak:
Incremental Recursive Ranking Grouping - A Decomposition Strategy for Additively and Nonadditively Separable Problems. GECCO Companion 2023: 27-28 - [c18]Michal Witold Przewozniczek, Renato Tinós, Marcin Michal Komarnicki:
First Improvement Hill Climber with Linkage Learning - on Introducing Dark Gray-Box Optimization into Statistical Linkage Learning Genetic Algorithms. GECCO 2023: 946-954 - [c17]Michal Witold Przewozniczek, Marcin Michal Komarnicki:
To slide or not to slide? Moving along fitness levels and preserving the gene subsets diversity in modern evolutionary computation. GECCO 2023: 955-962 - 2022
- [c16]Michal Witold Przewozniczek, Marcin M. Komarnicki:
Empirical linkage learning for non-binary discrete search spaces in the optimization of a large-scale real-world problem. GECCO Companion 2022: 35-36 - [c15]Michal Witold Przewozniczek, Renato Tinós, Bartosz Frej, Marcin M. Komarnicki:
On turning black - into dark gray-optimization with the direct empirical linkage discovery and partition crossover. GECCO 2022: 269-277 - [i1]Marcin Michal Komarnicki, Michal Witold Przewozniczek, Halina Kwasnicka:
Incremental Recursive Ranking Grouping for Large Scale Global Optimization. CoRR abs/2206.04168 (2022) - 2021
- [j5]Michal Witold Przewozniczek, Marcin Michal Komarnicki:
Empirical problem decomposition - the key to the evolutionary effectiveness in solving a large-scale non-binary discrete real-world problem. Appl. Soft Comput. 113(Part): 107864 (2021) - [c14]Michal Witold Przewozniczek, Marcin M. Komarnicki:
Fitness Caching - From a Minor Mechanism to Major Consequences in Modern Evolutionary Computation. CEC 2021: 1785-1791 - [c13]Michal Witold Przewozniczek, Marcin Michal Komarnicki, Bartosz Frej:
Direct linkage discovery with empirical linkage learning. GECCO 2021: 609-617 - [c12]Michal Witold Przewozniczek, Marcin M. Komarnicki, Peter A. N. Bosman, Dirk Thierens, Bartosz Frej, Ngoc Hoang Luong:
Hybrid linkage learning for permutation optimization with Gene-pool optimal mixing evolutionary algorithms. GECCO Companion 2021: 1442-1450 - 2020
- [j4]Michal Witold Przewozniczek, Rituparna Datta, Krzysztof Walkowiak, Marcin Michal Komarnicki:
Splitting the fitness and penalty factor for temporal diversity increase in practical problem solving. Expert Syst. Appl. 145: 113126 (2020) - [j3]Piotr Dziurzanski, Shuai Zhao, Michal Przewozniczek, Marcin Komarnicki, Leandro Soares Indrusiak:
Scalable distributed evolutionary algorithm orchestration using Docker containers. J. Comput. Sci. 40: 101069 (2020) - [j2]Michal Witold Przewozniczek, Marcin Michal Komarnicki:
Empirical Linkage Learning. IEEE Trans. Evol. Comput. 24(6): 1097-1111 (2020) - [c11]Michal Witold Przewozniczek, Marcin M. Komarnicki:
Empirical linkage learning. GECCO Companion 2020: 23-24 - [c10]Marcin M. Komarnicki, Michal Witold Przewozniczek, Tomasz M. Durda:
Comparative mixing for DSMGA-II. GECCO 2020: 708-716 - [c9]Michal Witold Przewozniczek, Bartosz Frej, Marcin M. Komarnicki:
On measuring and improving the quality of linkage learning in modern evolutionary algorithms applied to solve partially additively separable problems. GECCO 2020: 742-750 - [c8]Szymon Wozniak, Michal Przewozniczek, Marcin M. Komarnicki:
Parameter-Less Population Pyramid for Permutation-Based Problems. PPSN (1) 2020: 418-430
2010 – 2019
- 2019
- [j1]Michal Witold Przewozniczek, Krzysztof Walkowiak, Arunabha Sen, Marcin Komarnicki, Piotr Lechowicz:
The transformation of the k-Shortest Steiner trees search problem into binary dynamic problem for effective evolutionary methods application. Inf. Sci. 479: 1-19 (2019) - [c7]Marcin M. Komarnicki, Michal Witold Przewozniczek:
Parameter-less, population-sizing DSMGA-II. GECCO (Companion) 2019: 289-290 - [c6]Adam M. Zielinski, Marcin M. Komarnicki, Michal Witold Przewozniczek:
Parameter-less population pyramid with automatic feedback. GECCO (Companion) 2019: 312-313 - [c5]Shuai Zhao, Piotr Dziurzanski, Michal Przewozniczek, Marcin Komarnicki, Leandro Soares Indrusiak:
Cloud-based dynamic distributed optimisation of integrated process planning and scheduling in smart factories. GECCO 2019: 1381-1389 - 2018
- [c4]Michal Przewozniczek, Marcin Komarnicki:
The Practical Use of Problem Encoding Allowing Cheap Fitness Computation of Mutated Individuals. FedCSIS 2018: 57-65 - [c3]Michal Witold Przewozniczek, Marcin M. Komarnicki:
The influence of fitness caching on modern evolutionary methods and fair computation load measurement. GECCO (Companion) 2018: 241-242 - 2017
- [c2]Marcin M. Komarnicki, Michal Witold Przewozniczek:
Parameter-less population pyramid with feedback. GECCO (Companion) 2017: 109-110 - 2016
- [c1]Marcin Komarnicki, Michal Przewozniczek:
Linked Genes Migration in Island Models. IJCCI (ECTA) 2016: 30-40
Coauthor Index
aka: Michal Witold Przewozniczek
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-06 23:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
