Sciweavers

    1254 search results - page 175 / 251
    » Making Hard Problems Harder
    Sort
    View
    GECCO
    2008
    Springer
    186views Optimization» more  GECCO 2008»
    A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
    13 years 11 months ago
    A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
    Download  www.cloudbus.org
    One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
    A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...
    claim paper
    Read More »
    GECCO
    2008
    Springer
    175views Optimization» more  GECCO 2008»
    Using differential evolution for symbolic regression and numerical constant creation
    13 years 11 months ago
    Using differential evolution for symbolic regression and numerical constant creation
    Download  www.cs.bham.ac.uk
    One problem that has plagued Genetic Programming (GP) and its derivatives is numerical constant creation. Given a mathematical formula expressed as a tree structure, the leaf node...
    Brian M. Cerny, Peter C. Nelson, Chi Zhou
    claim paper
    Read More »
    MM
    2010
    ACM
    177views Multimedia» more  MM 2010»
    Image tag refinement towards low-rank, content-tag prior and error sparsity
    13 years 10 months ago
    Image tag refinement towards low-rank, content-tag prior and error sparsity
    Download  perception.csl.uiuc.edu
    The vast user-provided image tags on the popular photo sharing websites may greatly facilitate image retrieval and management. However, these tags are often imprecise and/or incom...
    Guangyu Zhu, Shuicheng Yan, Yi Ma
    claim paper
    Read More »
    SPAA
    2010
    ACM
    198views Distributed And Parallel Com...» more  SPAA 2010»
    On the bit communication complexity of randomized rumor spreading
    13 years 10 months ago
    On the bit communication complexity of randomized rumor spreading
    Download  www.liafa.jussieu.fr
    We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
    Pierre Fraigniaud, George Giakkoupis
    claim paper
    Read More »
    MST
    2006
    136views more  MST 2006»
    Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
    13 years 10 months ago
    Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
    Download  people.csail.mit.edu
    Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
    David R. Karger, Matthias Ruhl
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.