Sciweavers

    334 search results - page 1 / 67
    » How to Dynamically Merge Markov Decision Processes
    Sort
    View
    NIPS
    1997
    124views Information Technology» more  NIPS 1997»
    How to Dynamically Merge Markov Decision Processes
    13 years 6 months ago
    How to Dynamically Merge Markov Decision Processes
    Download  www.eecs.umich.edu
    Satinder P. Singh, David Cohn
    claim paper
    Read More »
    NIPS
    2004
    103views Information Technology» more  NIPS 2004»
    Experts in a Markov Decision Process
    13 years 6 months ago
    Experts in a Markov Decision Process
    Download  books.nips.cc
    We consider an MDP setting in which the reward function is allowed to change during each time step of play (possibly in an adversarial manner), yet the dynamics remain fixed. Simi...
    Eyal Even-Dar, Sham M. Kakade, Yishay Mansour
    claim paper
    Read More »
    PAMI
    2007
    186views more  PAMI 2007»
    Value-Directed Human Behavior Analysis from Video Using Partially Observable Markov Decision Processes
    13 years 4 months ago
    Value-Directed Human Behavior Analysis from Video Using Partially Observable Markov Decision Processes
    Download  people.ee.duke.edu
    —This paper presents a method for learning decision theoretic models of human behaviors from video data. Our system learns relationships between the movements of a person, the co...
    Jesse Hoey, James J. Little
    claim paper
    Read More »
    AUTOMATICA
    2008
    104views more  AUTOMATICA 2008»
    Exact finite approximations of average-cost countable Markov decision processes
    13 years 5 months ago
    Exact finite approximations of average-cost countable Markov decision processes
    Download  webee.technion.ac.il
    For a countable-state Markov decision process we introduce an embedding which produces a finite-state Markov decision process. The finite-state embedded process has the same optim...
    Arie Leizarowitz, Adam Shwartz
    claim paper
    Read More »
    AAAI
    1996
    197views Intelligent Agents» more  AAAI 1996»
    Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
    13 years 6 months ago
    Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
    Download  people.cs.ubc.ca
    : Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
    Craig Boutilier, David Poole
    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.