Sciweavers

    14774 search results - page 124 / 2955
    » Computational complexity and evolutionary computation
    Sort
    View
    EC
    2010
    158views ECommerce» more  EC 2010»
    An Efficient Algorithm for Computing Hypervolume Contributions
    15 years 1 months ago
    An Efficient Algorithm for Computing Hypervolume Contributions
    Download  www.mpi-inf.mpg.de
    The hypervolume indicator serves as a sorting criterion in many recent multi-objective evolutionary algorithms (MOEAs). Typical algorithms remove the solution with the smallest lo...
    Karl Bringmann, Tobias Friedrich
    claim paper
    Read More »
    137
    Voted
    PPSN
    2010
    Springer
    117views Distributed And Parallel Com...» more  PPSN 2010»
    General Lower Bounds for the Running Time of Evolutionary Algorithms
    15 years 2 months ago
    General Lower Bounds for the Running Time of Evolutionary Algorithms
    Download  www.icsi.berkeley.edu
    Abstract. We present a new method for proving lower bounds in evolutionary computation based on fitness-level arguments and an additional condition on transition probabilities bet...
    Dirk Sudholt
    claim paper
    Read More »
    111
    Voted
    ICDCS
    2008
    IEEE
    157views Distributed And Parallel Com...» more  ICDCS 2008»
    Autotuning Configurations in Distributed Systems for Performance Improvements Using Evolutionary Strategies
    15 years 10 months ago
    Autotuning Configurations in Distributed Systems for Performance Improvements Using Evolutionary Strategies
    Download  www.nec-labs.com
    Anooshiravan Saboori, Guofei Jiang, Haifeng Chen
    claim paper
    Read More »
    PPSN
    2004
    Springer
    102views Distributed And Parallel Com...» more  PPSN 2004»
    On Test Functions for Evolutionary Multi-objective Optimization
    15 years 9 months ago
    On Test Functions for Evolutionary Multi-objective Optimization
    Download  www.soft-computing.de
    Tatsuya Okabe, Yaochu Jin, Markus Olhofer, Bernhar...
    claim paper
    Read More »
    FOCS
    1998
    IEEE
    83views Theoretical Computer Science» more  FOCS 1998»
    Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model
    15 years 8 months ago
    Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model
    Download  www.csc.liv.ac.uk
    Mary Cryan, Leslie Ann Goldberg, Paul W. Goldberg
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.