Sciweavers

    APAL
    2011
    185views Software Engineering» more  APAL 2011»
    The provably total NP search problems of weak second order bounded arithmetic
    12 years 11 months ago
    The provably total NP search problems of weak second order bounded arithmetic
    Download  www.mimuw.edu.pl
    We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
    Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
    claim paper
    Read More »
    GECCO
    2003
    Springer
    97views Optimization» more  GECCO 2003»
    A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
    13 years 9 months ago
    A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
    Download  www.cs.york.ac.uk
    We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
    William A. Greene
    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.