default search action
Jaroslaw Arabas
Person information
- affiliation: Warsaw University of Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c23]Konrad Krawczyk
, Jaroslaw Arabas
Empirical Study of Surrogate Model Assisting JADE: Relation Between the Model Accuracy and the Optimization Efficiency. GECCO Companion 2024: 2023-2031 - 2023
- [c22]Konrad Krawczyk
JADE with k Nearest Neighbors Surrogate Model. GECCO Companion 2023: 2282-2285 - [c21]Konrad Krawczyk
Comparison of Different Surrogate Models for the JADE Algorithm. IJCCI 2023: 186-194 - 2022
- [j12]Bin Cao
Multiobjective Evolution of the Explainable Fuzzy Rough Neural Network With Gene Expression Programming. IEEE Trans. Fuzzy Syst. 30(10): 4190-4200 (2022) - [c20]Rafal Biedrzycki
A Version of NL-SHADE-RSP Algorithm with Midpoint for CEC 2022 Single Objective Bound Constrained Problems. CEC 2022: 1-8 - [c19]Eryk Warchulski
Improving the differential evolution strategy by coupling it with CMA-ES. GECCO Companion 2022: 407-410 - 2021
- [c18]Eryk Warchulski
A New Step-Size Adaptation Rule for CMA-ES Based on the Population Midpoint Fitness. CEC 2021: 825-831 - 2020
- [j11]Jaroslaw Arabas
Toward a Matrix-Free Covariance Matrix Adaptation Evolution Strategy. IEEE Trans. Evol. Comput. 24(1): 84-98 (2020) - [j10]Jaroslaw Arabas
Population Diversity of Nonelitist Evolutionary Algorithms in the Exploration Phase. IEEE Trans. Evol. Comput. 24(6): 1050-1062 (2020)
2010 – 2019
- 2019
- [j9]Karol R. Opara
Differential Evolution: A survey of theoretical analyses. Swarm Evol. Comput. 44: 546-558 (2019) - [j8]Rafal Biedrzycki
Bound constraints handling in Differential Evolution: An experimental study. Swarm Evol. Comput. 50 (2019) - [j7]Karol R. Opara
The contour fitting property of differential mutation. Swarm Evol. Comput. 50 (2019) - 2018
- [j6]Karol R. Opara
Comparison of mutation strategies in Differential Evolution - A probabilistic perspective. Swarm Evol. Comput. 39: 53-69 (2018) - 2017
- [j5]Jaroslaw Arabas
Improving Evolutionary Algorithms in a Continuous Domain by Monitoring the Population Midpoint. IEEE Trans. Evol. Comput. 21(5): 807-812 (2017) - [c17]Dariusz Jagodzinski
A differential evolution strategy. CEC 2017: 1872-1876 - 2014
- [c16]Rafal Biedrzycki, Jaroslaw Arabas, Agata Jasik, Michal Szymanski, Pawel Wnuk, Piotr Wasylczyk
Application of Evolutionary Methods to Semiconductor Double-Chirped Mirrors Design. PPSN 2014: 761-770 - [c15]Jaroslaw Arabas
Quasi-Stability of Real Coded Finite Populations. PPSN 2014: 872-881 - 2013
- [c14]Karol R. Opara
Censoring mutation in differential evolution. SDE 2013: 54-60 - 2012
- [j4]Rafal Biedrzycki
KIS: An automated attribute induction method for classification of DNA sequences. Int. J. Appl. Math. Comput. Sci. 22(3): 711-721 (2012) - [j3]Jaroslaw Arabas
Approximating the Genetic Diversity of Populations in the Quasi-Equilibrium State. IEEE Trans. Evol. Comput. 16(5): 632-644 (2012) - [c13]Jaroslaw Arabas
PARADE: A Massively Parallel Differential Evolution Template for EASEA. ICAISC (SIDE-EC) 2012: 12-20 - [c12]Karol R. Opara
Decomposition and Metaoptimization of Mutation Operator in Differential Evolution. ICAISC (SIDE-EC) 2012: 110-118 - 2011
- [c11]Pawel Zawistowski
Benchmarking IBHM Method Using NN3 Competition Dataset. HAIS (1) 2011: 263-270 - [c10]Jaroslaw Arabas
DMEA - An algorithm that combines differential mutation with the fitness proportionate selection. SDE 2011: 49-56 - 2010
- [c9]Karol R. Opara
Differential Mutation Based on Population Covariance Matrix. PPSN (1) 2010: 114-123 - [c8]Jaroslaw Arabas
Experimental Comparison of Methods to Handle Boundary Constraints in Differential Evolution. PPSN (2) 2010: 411-420
2000 – 2009
- 2008
- [c7]Pawel Wawrzynski
Predictive Control for Artificial Intelligence in Computer Games. ICAISC 2008: 1137-1148 - 2006
- [j2]Jacek Wojciechowski, Jaroslaw Arabas
Heuristic maximization of the number of spanning trees in regular graphs. J. Frankl. Inst. 343(3): 309-325 (2006) - 2001
- [j1]Jaroslaw Arabas
Applying an evolutionary algorithm to telecommunication network design. IEEE Trans. Evol. Comput. 5(4): 309-322 (2001) - 2000
- [c6]Blazej Sawionek, Jacek Wojciechowski, Jaroslaw Arabas
Synthesis of reliable networks in the presence of line failures. ISCAS 2000: 649-652
1990 – 1999
- 1999
- [c5]Blazej Sawionek, Jacek Wojciechowski, Jaroslaw Arabas
Designing regular graphs with the use of evolutionary algorithms. CEC 1999: 1832-1842 - 1997
- [c4]Stanislaw Kozdrowski, Michal Pióro, Jaroslaw Arabas, Michal Szczesniak:
Robust Design of Multicommodity Integral Flow Networks. ICGA 1997: 607-614 - 1995
- [c3]Jaroslaw Arabas, Jan J. Mulawka, Jacek Pokrasniewicz:
A New Class of the Crossover Operators for the Numerical Optimization. ICGA 1995: 42-48 - 1994
- [c2]Jaroslaw Arabas, Zbigniew Michalewicz, Jan J. Mulawka:
GAVaPS - A Genetic Algorithm with Varying Population Size. International Conference on Evolutionary Computation 1994: 73-78 - [c1]Zbigniew Michalewicz, Jaroslaw Arabas:
Genetic Algorithms for the 0/1 Knapsack Problem. ISMIS 1994: 134-143
Coauthor Index
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-08-23 19:25 CEST 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: