Sciweavers

    952 search results - page 4 / 191
    » Computational complexity of stochastic programming problems
    Sort
    View
    CCE
    2004
    166views Software Engineering» more  CCE 2004»
    Stochastic maximum principle for optimal control under uncertainty
    13 years 9 months ago
    Stochastic maximum principle for optimal control under uncertainty
    Download  www.vri-custom.org
    Optimal control problems involve the difficult task of determining time-varying profiles through dynamic optimization. Such problems become even more complex in practical situatio...
    Vicente Rico-Ramírez, Urmila M. Diwekar
    claim paper
    Read More »
    JGO
    2008
    83views more  JGO 2008»
    Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
    13 years 9 months ago
    Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
    Download  edoc.hu-berlin.de
    Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
    Lewis Ntaimo, Matthew W. Tanner
    claim paper
    Read More »
    SAC
    2008
    ACM
    263views Applied Computing» more  SAC 2008»
    Computational methods for complex stochastic systems: a review of some alternatives to MCMC
    13 years 9 months ago
    Computational methods for complex stochastic systems: a review of some alternatives to MCMC
    Download  eprints.lancs.ac.uk
    We consider analysis of complex stochastic models based upon partial information. MCMC and reversible jump MCMC are often the methods of choice for such problems, but in some situ...
    Paul Fearnhead
    claim paper
    Read More »
    CCE
    2006
    119views Software Engineering» more  CCE 2006»
    An efficient algorithm for large scale stochastic nonlinear programming problems
    13 years 9 months ago
    An efficient algorithm for large scale stochastic nonlinear programming problems
    Download  www.vri-custom.org
    The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
    Y. Shastri, Urmila M. Diwekar
    claim paper
    Read More »
    FOCS
    2007
    IEEE
    174views Theoretical Computer Science» more  FOCS 2007»
    On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
    14 years 4 months ago
    On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
    Download  homepages.inf.ed.ac.uk
    d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
    Kousha Etessami, Mihalis Yannakakis
    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.