Results 231 to 240 of about 2,015 (249)
Some of the next articles are maybe not open access.
Pareto epsilon-dominance and identifiable solutions for BioCAD modeling
Proceedings of the 50th Annual Design Automation Conference, 2013We propose a framework to design metabolic pathways in which many objectives are optimized simultaneously. This allows to characterize the energy signature in models of algal and mitochondrial metabolism. The optimal design and assessment of the model is achieved through a multi-objective optimization technique driven by epsilon-dominance and ...
C. Angione +4 more
openaire +2 more sources
A New Many-Objective Evolutionary Algorithm Based on Generalized Pareto Dominance
IEEE Transactions on Cybernetics, 2022In the past several years, it has become apparent that the effectiveness of Pareto-dominance-based multiobjective evolutionary algorithms deteriorates progressively as the number of objectives in the problem, given by M , grows. This is mainly due to the poor discriminability of Pareto optimality in many-objective spaces (typically M ≥ 4 ).
Shuwei Zhu +3 more
openaire +2 more sources
Path independence and Pareto dominance [PDF]
Economics Bulletin, 2004 A choice function on a finite set is path independent if and only if it can be represented as the choice of undominated alternatives taking into account mixed strategy domination.
openaire
Robust Multi-Objective optimization using Conditional Pareto Optimal Dominance
2020 IEEE Congress on Evolutionary Computation (CEC), 2020Robust optimization of real-world problems is essential to reduce the significant negative impact of uncertainties and noises present in the environment. Uncertainties in the decision variables are often handled using explicit or implicit averaging methods, in which the fitness of a solution isjudged based on the objective values of neighbouring ...
Seyedeh Zahra Mirjalili +3 more
openaire +1 more source
Using ε-Dominance for Hidden and Degenerated Pareto-Fronts
2015 IEEE Symposium Series on Computational Intelligence, 2015Scalable multi-objective test problems are known to be useful in testing and analyzing the abilities of algorithms. In this paper we focus on test problems with degenerated Pareto-fronts and provide an in-depth insight into the properties of some problems which show these characteristics. In some of the problems with degenerated fronts such as Distance
Heiner Zille, Sanaz Mostaghim
openaire +1 more source
A characterization of the n-agent Pareto dominance relation
Social Choice and Welfare, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A classification and Pareto domination based multiobjective evolutionary algorithm
2015 IEEE Congress on Evolutionary Computation (CEC), 2015In multiobjective evolutionary algorithms, most selection operators are based on the objective values or the approximated objective values. It is arguable that the selection in evolutionary algorithms is a classification problem in nature, i.e., selection equals to classifying the selected solutions into one class and the unselected ones into another ...
Jinyuan Zhang, Aimin Zhou, Guixu Zhang
openaire +1 more source
A Pareto-dominant clustering approach for Pareto-frontiers
2019anaging large and confusing sets of increasing data is a well-known problem in Data Mining. Since compromises in many use cases like Recommender Systems or preference-based applications are becoming more and more usual, it is very useful to cluster sets of promising results in order to get an overview and present them properly. In this paper we present
Kastner, Johannes +2 more
openaire +1 more source
Coalition-proofness under weak and strong Pareto dominance
Social Choice and Welfare, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
CP-Nets, $$\pi $$-pref Nets, and Pareto Dominance
2019Two approaches have been proposed for the graphical handling of qualitative conditional preferences between solutions described in terms of a finite set of features: Conditional Preference networks (CP-nets for short) and more recently, Possibilistic Preference networks (\(\pi \)-pref nets for short).
Nic Wilson, Didier Dubois, Henri Prade
openaire +1 more source