par Fonseca, Carlos M.;Guerreiro, Andreia P.;López-Ibáñez, Manuel ;Paquete, Luis
Référence Lecture notes in computer science, 6576, page (106-120)
Publication Publié, 2011
Article révisé par les pairs
Résumé : 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. © 2011 Springer-Verlag.