Results 21 to 30 of about 2,015 (249)
Pareto dominance-based MOEAs on problems with difficult pareto set topologies
Despite the extensive application of multi-objective evolutionary algorithms (MOEAs) to solve multi-objective optimization problems (MOPs), understanding their working principles is still open to research. One of the most popular and successful MOEA approaches is based on Pareto dominance and its relaxed version, Pareto epsilon-dominance. However, such
Marca, Yuri +6 more
openaire +2 more sources
In many objective optimization problems (MaOPs), more than three distinct objectives are optimized. The challenging part in MaOPs is to get the Pareto approximation (PA) with high diversity and good convergence. In Literature, in order to solve the issue
Uzman Perwaiz +2 more
doaj +1 more source
Pruning Dominated Policies in Multiobjective Pareto Q-Learning [PDF]
Supported by: the Spanish Government, Agencia Estatal de Investigaci´on (AEI) and European Union, Fondo Europeo de Desarrollo Regional (FEDER), grant TIN2016-80774-R (AEI/FEDER, UE); and Plan Propio de Investigación de la Universidad de Málaga - Campus de Excelencia Internacional Andalucía Tech.
Mandow-Andaluz, Lorenzo +1 more
openaire +3 more sources
Multi-Target Analysis and Design of Mitochondrial Metabolism. [PDF]
Analyzing and optimizing biological models is often identified as a research priority in biomedical engineering. An important feature of a model should be the ability to find the best condition in which an organism has to be grown in order to reach ...
Claudio Angione +4 more
doaj +1 more source
A Mating Selection Based on Modified Strengthened Dominance Relation for NSGA-III
In multi/many-objective evolutionary algorithms (MOEAs), to alleviate the degraded convergence pressure of Pareto dominance with the increase in the number of objectives, numerous modified dominance relationships were proposed. Recently, the strengthened
Saykat Dutta +4 more
doaj +1 more source
Construction of Generating Feasible Subsets in the Knapsack Problem
A method for constructing a group of generating feasible subsets in the knapsack problem under the condition that the non-dominance depth of a given Pareto layer is greater than zero is developed.
S. V. Chebakov, L. V. Serebryanaya
doaj +1 more source
Optimum Nozzle Design for a Viscous Liquid by Using Multi-Objective Search Approaches
This work deals with the problem of a nozzle design addressed through a multi-objective optimization strategy where governing equations of fluid dynamics model the phenomena.
Victor Dario Cuervo Pinto +3 more
doaj +1 more source
Feature selection using non-dominant features-guided search for gene expression profile data
Gene expression profile data have high-dimensionality with a small number of samples. These data characteristics lead to a long training time and low performance in predictive model construction.
Xiaoying Pan +3 more
doaj +1 more source
Clustering, an unsupervised method of grouping sets of data, is used as a solution technique in various fields to divide and restructure data to become more significant and transform them into more useful information.
Alwatben Batoul Rashed +5 more
doaj +1 more source
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +1 more source

