Sciweavers

334 search results - page 9 / 67
» How to Dynamically Merge Markov Decision Processes
Sort
View
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
14 years 7 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen
VLDB
1999
ACM
107views Database» more  VLDB 1999»
15 years 1 months ago
The Value of Merge-Join and Hash-Join in SQL Server
Microsoft SQL Server was successful for many years for transaction processing and decision support workloads with neither merge join nor hash join, relying entirely on nested loop...
Goetz Graefe
ISCC
2000
IEEE
104views Communications» more  ISCC 2000»
15 years 2 months ago
Dynamic Routing and Wavelength Assignment Using First Policy Iteration
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
Esa Hyytiä, Jorma T. Virtamo
NIPS
2004
14 years 11 months ago
Modeling Conversational Dynamics as a Mixed-Memory Markov Process
In this work, we quantitatively investigate the ways in which a given person influences the joint turn-taking behavior in a conversation. After collecting an auditory database of ...
Tanzeem Choudhury, Sumit Basu
ATAL
2008
Springer
14 years 11 months ago
Controlling deliberation in a Markov decision process-based agent
Meta-level control manages the allocation of limited resources to deliberative actions. This paper discusses efforts in adding meta-level control capabilities to a Markov Decision...
George Alexander, Anita Raja, David J. Musliner