Sciweavers

5171 search results - page 11 / 1035
» Deterministic Parallel Processing
Sort
View
ALT
2008
Springer
14 years 4 months ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
ICDT
2003
ACM
106views Database» more  ICDT 2003»
14 years 1 months ago
Processing XML Streams with Deterministic Automata
We consider the problem of evaluating a large number of XPath expressions on an XML stream. Our main contribution consists in showing that Deterministic Finite Automata (DFA) can b...
Todd J. Green, Gerome Miklau, Makoto Onizuka, Dan ...
CDC
2008
IEEE
14 years 2 months ago
The vanishing approach for the average continuous control of piecewise deterministic Markov processes
Abstract— This paper deals with the long run average continuous control problem of piecewise deterministic Markov processes (PDMP‘s) taking values in a general Borel space and ...
Oswaldo Luiz V. Costa, Francois Dufour
TALG
2010
73views more  TALG 2010»
13 years 6 months ago
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
Omid Madani, Mikkel Thorup, Uri Zwick
JAIR
2011
144views more  JAIR 2011»
13 years 2 months ago
Non-Deterministic Policies in Markovian Decision Processes
Markovian processes have long been used to model stochastic environments. Reinforcement learning has emerged as a framework to solve sequential planning and decision-making proble...
Mahdi Milani Fard, Joelle Pineau