Sciweavers

    971 search results - page 3 / 195
    » Approximate Satisfiability and Equivalence
    Sort
    View
    IPL
    2006
    84views more  IPL 2006»
    On the hardness of approximating Max-Satisfy
    13 years 5 months ago
    On the hardness of approximating Max-Satisfy
    Download  research.microsoft.com
    Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
    Uriel Feige, Daniel Reichman
    claim paper
    Read More »
    IPL
    2008
    95views more  IPL 2008»
    Approximating maximum satisfiable subsystems of linear equations of bounded width
    13 years 5 months ago
    Approximating maximum satisfiable subsystems of linear equations of bounded width
    Download  www.openu.ac.il
    We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
    Zeev Nutov, Daniel Reichman
    claim paper
    Read More »
    SIGECOM
    2010
    ACM
    173views ECommerce» more  SIGECOM 2010»
    Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
    13 years 6 months ago
    Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
    Download  www.seas.upenn.edu
    Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
    Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
    claim paper
    Read More »
    ENTCS
    2008
    97views more  ENTCS 2008»
    An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
    13 years 5 months ago
    An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
    Download  formale-sprachen.informatik.uni-oldenburg.de
    The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
    Karl-Heinz Pennemann
    claim paper
    Read More »
    ECSQARU
    2005
    Springer
    98views Automated Reasoning» more  ECSQARU 2005»
    APPSSAT: Approximate Probabilistic Planning Using Stochastic Satisfiability
    13 years 11 months ago
    APPSSAT: Approximate Probabilistic Planning Using Stochastic Satisfiability
    Download  www.bowdoin.edu
    Stephen M. Majercik
    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.