Sciweavers

    25 search results - page 1 / 5
    » A new smoothing Newton-type algorithm for semi-infinite prog...
    Sort
    View
    SIAMJO
    2010
    136views more  SIAMJO 2010»
    A New Exchange Method for Convex Semi-Infinite Programming
    12 years 11 months ago
    A New Exchange Method for Convex Semi-Infinite Programming
    Download  www.ncts.ncku.edu.tw
    In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
    Liping Zhang, Soon-Yi Wu, Marco A. López
    claim paper
    Read More »
    SIAMJO
    2008
    99views more  SIAMJO 2008»
    The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
    13 years 4 months ago
    The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
    Download  home.dei.polimi.it
    Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
    Marco C. Campi, Simone Garatti
    claim paper
    Read More »
    JGO
    2010
    61views more  JGO 2010»
    A new smoothing Newton-type algorithm for semi-infinite programming
    12 years 11 months ago
    A new smoothing Newton-type algorithm for semi-infinite programming
    Download  math.shu.edu.cn
    Chen Ling, Qin Ni, Liqun Qi, Soon-Yi Wu
    claim paper
    Read More »
    WWW
    2008
    ACM
    130views Internet Technology» more  WWW 2008»
    Enhanced hierarchical classification via isotonic smoothing
    14 years 5 months ago
    Enhanced hierarchical classification via isotonic smoothing
    Download  www2008.org
    Hierarchical topic taxonomies have proliferated on the World Wide Web [5, 18], and exploiting the output space decompositions they induce in automated classification systems is an...
    Kunal Punera, Joydeep Ghosh
    claim paper
    Read More »
    FM
    2009
    Springer
    104views Formal Methods» more  FM 2009»
    A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
    13 years 11 months ago
    A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis
    Download  www2.in.tum.de
    Abstract. We present a new domain for analyzing must-equalities between address expressions. The domain is a smooth combination of Herbrand and affine equalities which enables us t...
    Helmut Seidl, Vesal Vojdani, Varmo Vene
    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.