Sciweavers

    771 search results - page 32 / 155
    » Markov Decision Processes with Arbitrary Reward Processes
    Sort
    View
    109
    Voted
    NIPS
    1997
    124views Information Technology» more  NIPS 1997»
    How to Dynamically Merge Markov Decision Processes
    15 years 3 months ago
    How to Dynamically Merge Markov Decision Processes
    Download  www.eecs.umich.edu
    Satinder P. Singh, David Cohn
    claim paper
    Read More »
    94
    Voted
    UAI
    1997
    84views Artificial Intelligence» more  UAI 1997»
    Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
    15 years 3 months ago
    Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes
    Download  www.sci.brooklyn.cuny.edu
    Anthony R. Cassandra, Michael L. Littman, Nevin Li...
    claim paper
    Read More »
    ICML
    2010
    IEEE
    223views Machine Learning» more  ICML 2010»
    Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
    15 years 2 months ago
    Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes
    Download  anytime.cs.umass.edu
    Approximate dynamic programming has been used successfully in a large variety of domains, but it relies on a small set of provided approximation features to calculate solutions re...
    Marek Petrik, Gavin Taylor, Ronald Parr, Shlomo Zi...
    claim paper
    Read More »
    FSS
    2006
    84views more  FSS 2006»
    A fuzzy approach to Markov decision processes with uncertain transition probabilities
    15 years 1 months ago
    A fuzzy approach to Markov decision processes with uncertain transition probabilities
    Download  www.math.s.chiba-u.ac.jp
    M. Kurano, M. Yasuda, J. Nakagami, Y. Yoshida
    claim paper
    Read More »
    121
    Voted
    ORL
    2008
    68views more  ORL 2008»
    On polynomial cases of the unichain classification problem for Markov Decision Processes
    15 years 1 months ago
    On polynomial cases of the unichain classification problem for Markov Decision Processes
    Download  www.ams.sunysb.edu
    The unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard [11]. This paper provides p...
    Eugene A. Feinberg, Fenghsu Yang
    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-2026, USA.