Sciweavers

    881 search results - page 3 / 177
    » Solving satisfiability problems with preferences
    Sort
    View
    175
    Voted
    IPPS
    1999
    IEEE
    138views Distributed And Parallel Com...» more  IPPS 1999»
    Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
    15 years 10 months ago
    Solving Satisfiability Problems on FPGAs using Experimental Unit Propagation Heuristic
    Download  ipdps.cc.gatech.edu
    This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
    Takayuki Suyama, Makoto Yokoo, Akira Nagoya
    claim paper
    Read More »
    DASFAA
    2009
    IEEE
    129views Database» more  DASFAA 2009»
    Towards Preference-Constrained k-Anonymisation
    16 years 1 months ago
    Towards Preference-Constrained k-Anonymisation
    Download  hiplab.mc.vanderbilt.edu
    Abstract. In this paper, we propose a novel preference-constrained approach to k-anonymisation. In contrast to the existing works on kanonymisation which attempt to satisfy a minim...
    Grigorios Loukides, Achilles Tziatzios, Jianhua Sh...
    claim paper
    Read More »
    135
    Voted
    ISVLSI
    2008
    IEEE
    142views VLSI» more  ISVLSI 2008»
    Using Higher Levels of Abstraction for Solving Optimization Problems by Boolean Satisfiability
    16 years 23 days ago
    Using Higher Levels of Abstraction for Solving Optimization Problems by Boolean Satisfiability
    Download  www.informatik.uni-bremen.de
    Robert Wille, Daniel Große, Mathias Soeken, ...
    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
    16 years 12 days 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 »
    ICTAI
    1999
    IEEE
    89views Artificial Intelligence» more  ICTAI 1999»
    Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers
    15 years 10 months ago
    Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers
    Download  manip.crhc.uiuc.edu
    Zhe Wu, Benjamin W. Wah
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.