Sciweavers

    RSA
    2011
    85views more  RSA 2011»
    Piercing random boxes
    12 years 11 months ago
    Piercing random boxes
    Download  www.math.rutgers.edu
    Abstract. Consider a set of n random axis parallel boxes in the unit hypercube in Rd , where d is fixed and n tends to infinity. We show that the minimum number of points one nee...
    Linh V. Tran
    claim paper
    Read More »
    EOR
    2008
    69views more  EOR 2008»
    On the complexity of optimization over the standard simplex
    13 years 5 months ago
    On the complexity of optimization over the standard simplex
    Download  www.optimization-online.org
    We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
    E. de Klerk, Dick den Hertog, G. Elabwabi
    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.