Sciweavers

    117 search results - page 24 / 24
    » Run-Time Bytecode Specialization
    Sort
    View
    SAT
    2010
    Springer
    172views Hardware» more  SAT 2010»
    On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
    13 years 8 months ago
    On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
    Download  www.cs.toronto.edu
    Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
    Denis Pankratov, Allan Borodin
    claim paper
    Read More »
    STACS
    2010
    Springer
    172views Theoretical Computer Science» more  STACS 2010»
    Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
    14 years 4 months ago
    Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
    Download  www.ii.uib.no
    In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
    Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
    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.