On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Multiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Inferential Performance Assessment of Stochastic Optimisers and the Attainment Function
EMO '01 Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization
ISDA '05 Proceedings of the 5th International Conference on Intelligent Systems Design and Applications
PISA: a platform and programming language independent interface for search algorithms
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
GECCO 2012 tutorial on evolutionary multiobjective optimization
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
An evolutionary optimization approach for bulk material blending systems
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
The relationship between the covered fraction, completeness and hypervolume indicators
EA'11 Proceedings of the 10th international conference on Artificial Evolution
An approach to visualizing the 3D empirical attainment function
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
GECCO 2013 tutorial on evolutionary multiobjective optimization
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
The attainment function provides a description of the location of the distribution of a random non-dominated point set. This function can be estimated from experimental data via its empirical counterpart, the empirical attainment function (EAF). However, computation of the EAF in more than two dimensions is a non-trivial task. In this article, the problem of computing the empirical attainment function is formalised, and upper and lower bounds on the corresponding number of output points are presented. In addition, efficient algorithms for the two and three-dimensional cases are proposed, and their time complexities are related to lower bounds derived for each case.