Sciweavers

    1725 search results - page 4 / 345
    » Relaxed genetic programming
    Sort
    View
    SIAMJO
    2008
    66views more  SIAMJO 2008»
    Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
    13 years 7 months ago
    Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
    Download  www.stanford.edu
    Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
    Zizhuo Wang, Song Zheng, Yinyu Ye, Stephen Boyd
    claim paper
    Read More »
    ICML
    2009
    IEEE
    129views Machine Learning» more  ICML 2009»
    Solution stability in linear programming relaxations: graph partitioning and unsupervised learning
    14 years 8 months ago
    Solution stability in linear programming relaxations: graph partitioning and unsupervised learning
    Download  carbon.videolectures.net
    Sebastian Nowozin, Stefanie Jegelka
    claim paper
    Read More »
    CVPR
    2007
    IEEE
    147views Computer Vision» more  CVPR 2007»
    Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
    14 years 9 months ago
    Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming
    Download  www.maths.lth.se
    In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
    Carl Olsson, Anders P. Eriksson, Fredrik Kahl
    claim paper
    Read More »
    SIAMJO
    2000
    116views more  SIAMJO 2000»
    Computational Experience with an Interior Point Cutting Plane Algorithm
    13 years 7 months ago
    Computational Experience with an Interior Point Cutting Plane Algorithm
    Download  www.rpi.edu
    There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
    John E. Mitchell
    claim paper
    Read More »
    MP
    2006
    113views more  MP 2006»
    On the gap between the quadratic integer programming problem and its semidefinite relaxation
    13 years 7 months ago
    On the gap between the quadratic integer programming problem and its semidefinite relaxation
    Download  www.staff.city.ac.uk
    Consider the semidefinite relaxation (SDR) of the quadratic integer program (QIP): := maxx{-1,1}n xT Qx minD-Q 0 trace(D) =:
    U. Malik, Imad M. Jaimoukha, G. D. Halikias, S. K....
    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.