Sciweavers

    2 search results - page 1 / 1
    » Provably Near-Optimal Sampling-Based Policies for Stochastic...
    Sort
    View
    67
    Voted
    MOR
    2007
    125views more  MOR 2007»
    Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
    14 years 10 months ago
    Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
    Download  legacy.orie.cornell.edu
    Retsef Levi, Robin Roundy, David B. Shmoys
    claim paper
    Read More »
    IJCAI
    2001
    151views Artificial Intelligence» more  IJCAI 2001»
    R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
    14 years 12 months ago
    R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
    Download  jmlr.csail.mit.edu
    R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
    Ronen I. Brafman, Moshe Tennenholtz
    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-2025, USA.