Sciweavers

    952 search results - page 5 / 191
    » Computational complexity of stochastic programming problems
    Sort
    View
    WSC
    1998
    142views Modeling And Simulation» more  WSC 1998»
    Rostering by Iterating Integer Programming and Simulation
    14 years 5 months ago
    Rostering by Iterating Integer Programming and Simulation
    Download  www.informs-sim.org
    We present a new technique (RIIPS) for solving rostering problems in the presence of service uncertainty. RIIPS stands for "Rostering by Iterating Integer Programming and Sim...
    Shane G. Henderson, Andrew J. Mason
    claim paper
    Read More »
    AAAI
    2000
    104views Intelligent Agents» more  AAAI 2000»
    Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
    14 years 5 months ago
    Deliberation in Equilibrium: Bargaining in Computationally Complex Problems
    Download  www.aaai.org
    We develop a normative theory of interaction-negotiation in particular--among self-interested computationally limited agents where computational actions are game-theoretically tre...
    Kate Larson, Tuomas Sandholm
    claim paper
    Read More »
    ICALP
    2007
    Springer
    162views Programming Languages» more  ICALP 2007»
    Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
    14 years 10 months ago
    Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
    Download  www.cs.brown.edu
    Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
    Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal
    claim paper
    Read More »
    CCE
    2004
    162views Software Engineering» more  CCE 2004»
    An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
    14 years 4 months ago
    An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
    Download  www.che.gatech.edu
    The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
    Jaein Choi, Jay H. Lee, Matthew J. Realff
    claim paper
    Read More »
    ICAART
    2010
    INSTICC
    509views Intelligent Agents» more  ICAART 2010»
    Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
    15 years 1 months ago
    Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
    Download  arxiv.org
    There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
    Christos Dimitrakakis
    posted by olethros
    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-2025, USA.