Sciweavers

    ICAI
    2003
    113views Artificial Intelligence» more  ICAI 2003»
    Threshold Behavior in a Boolean Network Model for SAT
    14 years 28 days ago
    Threshold Behavior in a Boolean Network Model for SAT
    Download  www.isi.edu
    Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
    Alejandro Bugacov, Aram Galstyan, Kristina Lerman
    claim paper
    Read More »
    SODA
    2008
    ACM
    156views Algorithms» more  SODA 2008»
    Approximating TSP on metrics with bounded global growth
    14 years 29 days ago
    Approximating TSP on metrics with bounded global growth
    Download  www.cs.cmu.edu
    The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
    T.-H. Hubert Chan, Anupam Gupta
    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.