Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Ehab Z. Elfeky"'
Autor:
Ehab Z. Elfeky, Saber Elsayed, Luke Marsh, Daryl Essam, Madeleine Cochrane, Brendan Sims, Ruhul Sarker
Publikováno v:
IEEE Access, Vol 9, Pp 136647-136665 (2021)
Real-time strategy (RTS) games are a subgenre of strategy video games. Due to their importance in practical decision-making and digital entertainment over the last two decades, many researchers have explored different algorithmic approaches for contr
Externí odkaz:
https://doaj.org/article/05b513df260f4fb4a4d2b16a64c592aa
Autor:
Madeleine Cochrane, Saber M. Elsayed, Luke Marsh, Daryl Essam, Ruhul A. Sarker, Brendan Sims, Ehab Z. Elfeky
Publikováno v:
IEEE Access, Vol 9, Pp 136647-136665 (2021)
Real-time strategy (RTS) games are a subgenre of strategy video games. Due to their importance in practical decision-making and digital entertainment over the last two decades, many researchers have explored different algorithmic approaches for contr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff0d695bd789a75673bbf4ea3fba8b48
https://ieeexplore.ieee.org/document/9548932/
https://ieeexplore.ieee.org/document/9548932/
Publikováno v:
International Journal of Applied Metaheuristic Computing. 10:1-28
The performance of Differential Evolution is significantly affected by the mutation scheme, which attracts many researchers to develop and enhance the mutation scheme in DE. In this article, the authors introduce an enhanced DE algorithm (EDDE) that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b737915f75df9c623be2952616e1abb
https://doi.org/10.4018/ijamc.2019010101
https://doi.org/10.4018/ijamc.2019010101
Publikováno v:
Machine Learning Paradigms: Theory and Application ISBN: 9783030023560
Machine Learning Paradigms
Machine Learning Paradigms
This paper proposes an enhanced modified Differential Evolution algorithm (MI-EDDE) to solve global constrained optimization problems that consist of mixed/non-linear integer variables. The MI-EDDE algorithm, which is based on the constraints violati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a190156849363fbd5f231d689baf4cc
https://doi.org/10.1007/978-3-030-02357-7_16
https://doi.org/10.1007/978-3-030-02357-7_16
Publikováno v:
Operations Research and Enterprise Systems ISBN: 9783319947662
In recent years, many-objective optimization has become a popular research topic, after it was noted that algorithms that excelled in solving problems with two objectives were not suitable for problems with more than three objectives. In these more d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::995e0030f6794948076592c80c747b58
https://doi.org/10.1007/978-3-319-94767-9_9
https://doi.org/10.1007/978-3-319-94767-9_9
Publikováno v:
ICORES
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25f41834afcd5addbe6b20033a43d892
https://doi.org/10.5220/0006219504240429
https://doi.org/10.5220/0006219504240429
Publikováno v:
SMC
Large scale constrained optimization problem solving is a challenging research topic in the optimization and computational intelligence domain. This paper examines the possible division of computational tasks, into smaller interacting components, in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a999352c6c9849ef86568a292c0c4f8
https://doi.org/10.1109/icsmc.2008.4811278
https://doi.org/10.1109/icsmc.2008.4811278
Publikováno v:
SMC
The quality of individuals in the initial population influences the performance of evolutionary algorithms, especially when the feasible region of the constrained optimization problems is very tiny in comparison to the entire search space. Too much d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::971e5f764e7f160b573b3e9768027742
https://doi.org/10.1109/icsmc.2008.4811486
https://doi.org/10.1109/icsmc.2008.4811486
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540896937
SEAL
SEAL
This paper examines a new way of dividing computational tasks into smaller interacting components, in order to effectively solve constrained optimization problems. In dividing the tasks, we propose problem decomposition, and the use of GAs as the sol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2a296cceb7d67f89645e22905c922aa
https://doi.org/10.1007/978-3-540-89694-4_34
https://doi.org/10.1007/978-3-540-89694-4_34
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540473312
SEAL
SEAL
Many optimization problems that involve practical applications have functional constraints, and some of these constraints are active, meaning that they prevent any solution from improving the objective function value beyond the constraint limits. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71342009f48e3a5b156a6db66f139ea5
https://doi.org/10.1007/11903697_68
https://doi.org/10.1007/11903697_68