Sciweavers

    283 search results - page 7 / 57
    » Solving Over-Constrained Problems with SAT
    Sort
    View
    GRID
    2010
    Springer
    106views Distributed And Parallel Com...» more  GRID 2010»
    Parallel SAT Solving on Peer-to-Peer Desktop Grids
    13 years 5 months ago
    Parallel SAT Solving on Peer-to-Peer Desktop Grids
    Download  www-sr.informatik.uni-tuebingen.de
    Abstract Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domainspecific problems inherent to one of the most challenging environments f...
    Sven Schulz, Wolfgang Blochinger
    claim paper
    Read More »
    ICCAD
    2006
    IEEE
    100views Hardware» more  ICCAD 2006»
    Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search
    14 years 1 months ago
    Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search
    Download  www.cecs.uci.edu
    Zhaohui Fu, Sharad Malik
    claim paper
    Read More »
    JSAT
    2006
    94views more  JSAT 2006»
    A Note on the Use of Independent Sets for the k-SAT Problem
    13 years 7 months ago
    A Note on the Use of Independent Sets for the k-SAT Problem
    Download  jsat.ewi.tudelft.nl
    An independent set of variables is one in which no two variables occur in the same clause in a given k-SAT instance. Recently, independent sets have obtained more attention. Due t...
    Konstantin Kutzkov
    claim paper
    Read More »
    SAT
    2010
    Springer
    172views Hardware» more  SAT 2010»
    On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
    13 years 6 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 »
    CONSTRAINTS
    2010
    126views more  CONSTRAINTS 2010»
    Solving satisfiability problems with preferences
    13 years 5 months ago
    Solving satisfiability problems with preferences
    Download  www.mrg.dist.unige.it
    Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
    Emanuele Di Rosa, Enrico Giunchiglia, Marco Marate...
    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.