Sciweavers

    36 search results - page 1 / 8
    » Branch and Bound for Boolean Optimization and the Generation...
    Sort
    View
    SAT
    2009
    Springer
    97views Hardware» more  SAT 2009»
    Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
    14 years 1 months ago
    Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
    Download  www.lsi.upc.es
    Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
    claim paper
    Read More »
    SAT
    2004
    Springer
    97views Hardware» more  SAT 2004»
    Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
    13 years 12 months ago
    Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization
    Download  www.satisfiability.org
    Linear Pseudo-Boolean constraints offer a much more compact formalism to express significant boolean problems in several areas, ranging from Artificial Intelligence to Electroni...
    Vasco M. Manquinho, João P. Marques Silva
    claim paper
    Read More »
    JAR
    2011
    112views more  JAR 2011»
    A Framework for Certified Boolean Branch-and-Bound Optimization
    13 years 1 months ago
    A Framework for Certified Boolean Branch-and-Bound Optimization
    Download  www.lsi.upc.edu
    We consider optimization problems of the form (S, cost), where S is a clause set over Boolean variables x1 . . . xn, with an arbitrary cost function cost: Bn → R, and the aim is ...
    Javier Larrosa, Robert Nieuwenhuis, Albert Olivera...
    claim paper
    Read More »
    FLAIRS
    2008
    115views Artificial Intelligence» more  FLAIRS 2008»
    On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
    13 years 7 months ago
    On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
    Download  sat.inesc.pt
    Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...
    Federico Heras, Vasco M. Manquinho, João Ma...
    claim paper
    Read More »
    AAAI
    1998
    100views Intelligent Agents» more  AAAI 1998»
    Branch and Bound Algorithm Selection by Performance Prediction
    13 years 8 months ago
    Branch and Bound Algorithm Selection by Performance Prediction
    Download  www.aaai.org
    Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
    Lionel Lobjois, Michel Lemaître
    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.