Sciweavers

515 search results - page 38 / 103
» Approximating Markov Processes by Averaging
Sort
View
ICML
2001
IEEE
16 years 17 days ago
Continuous-Time Hierarchical Reinforcement Learning
Hierarchical reinforcement learning (RL) is a general framework which studies how to exploit the structure of actions and tasks to accelerate policy learning in large domains. Pri...
Mohammad Ghavamzadeh, Sridhar Mahadevan
92
Voted
WEBI
2010
Springer
14 years 9 months ago
Impacts of Analysts' Cognitive Styles on the Analytic Process
A user's cognitive style has been found to affect how they search for information, how they analyze the information, and how they make decisions in an analytical process. In ...
Eugene Santos Jr., Hien Nguyen, Fei Yu, Deqing Li,...
ICIP
2004
IEEE
16 years 1 months ago
Efficient proposal distributions for MCMC image segmentation
We present methods to obtain computationally efficient proposal distributions for Bayesian reversible jump Markov chain Monte Carlo (RJMCMC) based image segmentation. The slow con...
Timo Kostiainen, Jouko Lampinen
CSDA
2010
208views more  CSDA 2010»
14 years 12 months ago
Bayesian density estimation and model selection using nonparametric hierarchical mixtures
We consider mixtures of parametric densities on the positive reals with a normalized generalized gamma process (Brix, 1999) as mixing measure. This class of mixtures encompasses t...
Raffaele Argiento, Alessandra Guglielmi, Antonio P...
PE
2011
Springer
214views Optimization» more  PE 2011»
14 years 6 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...