Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:ojs.journals.agh.edu.pl:article/1179

Very Fast Non-dominated Sorting

Authors
Publication date
19 November 2014
Publisher
AGH University of Krakow Press
Doi

    Abstract

    New and very ecient parallel algorithm for the Fast Non-dominated Sorting of Pareto fronts is proposed. By decreasing its computational complexity, the application of the proposed method allows us to increase the speedup of the best up to now Fast and Elitist Multi-objective Genetic Algorithm (NSGA-II) more than two orders of magnitudes. Formal proofs of time complexities of basic as well as improved versions of the procedure are presented. Provided experimental results fully conrm theoretical ndings

    Similar works

    Full text

    thumbnail-image

    AGH (Akademia Górniczo-Hutnicza) University of Science and Technology: Journals

    redirect
    oaioai:ojs.journals.agh.edu.pl:ar...
    Last time updated on 17/10/2019

    This paper was published in AGH (Akademia Górniczo-Hutnicza) University of Science and Technology: Journals.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.