Sciweavers

    68 search results - page 7 / 14
    » Improved Approximation Algorithms for MAX NAE-SAT and MAX SA...
    Sort
    View
    ICANN
    2007
    Springer
    132views Neural Networks» more  ICANN 2007»
    MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set
    14 years 1 months ago
    MaxSet: An Algorithm for Finding a Good Approximation for the Largest Linearly Separable Set
    Download  www.lcc.uma.es
    Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
    Leonardo Franco, José Luis Subirats, Jos&ea...
    claim paper
    Read More »
    DAM
    2008
    111views more  DAM 2008»
    Sums of squares based approximation algorithms for MAX-SAT
    13 years 7 months ago
    Sums of squares based approximation algorithms for MAX-SAT
    Download  jsat.ewi.tudelft.nl
    We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
    Hans van Maaren, Linda van Norden, M. J. H. Heule
    claim paper
    Read More »
    COR
    2006
    82views more  COR 2006»
    Semidefinite programming based approaches to the break minimization problem
    13 years 7 months ago
    Semidefinite programming based approaches to the break minimization problem
    Download  www.ism.ac.jp
    This paper considers the break minimization problem in sports timetabling. The problem is to find, under a given timetable of a round-robin tournament, a home-away assignment that...
    Ryuhei Miyashiro, Tomomi Matsui
    claim paper
    Read More »
    UAI
    2008
    234views Artificial Intelligence» more  UAI 2008»
    Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
    13 years 8 months ago
    Improving the Accuracy and Efficiency of MAP Inference for Markov Logic
    Download  uai2008.cs.helsinki.fi
    In this work we present Cutting Plane Inference (CPI), a Maximum A Posteriori (MAP) inference method for Statistical Relational Learning. Framed in terms of Markov Logic and inspi...
    Sebastian Riedel
    claim paper
    Read More »
    ECCC
    2000
    93views more  ECCC 2000»
    Improved Approximation of MAX-CUT on Graphs of Bounded Degree
    13 years 7 months ago
    Improved Approximation of MAX-CUT on Graphs of Bounded Degree
    Download  reference.kfupm.edu.sa
    We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
    Uriel Feige, Marek Karpinski, Michael Langberg
    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.