Sciweavers

515 search results - page 51 / 103
» Approximating Markov Processes by Averaging
Sort
View
ICCAD
2002
IEEE
122views Hardware» more  ICCAD 2002»
16 years 3 months ago
Schedulability analysis of multiprocessor real-time applications with stochastic task execution times
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
Sorin Manolache, Petru Eles, Zebo Peng
ATAL
2009
Springer
16 years 20 days ago
Online exploration in least-squares policy iteration
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
Lihong Li, Michael L. Littman, Christopher R. Mans...
ATAL
2010
Springer
15 years 7 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
206
Voted
AIED
2011
Springer
14 years 9 months ago
Faster Teaching by POMDP Planning
Both human and automated tutors must infer what a student knows and plan future actions to maximize learning. Though substantial research has been done on tracking and modeling stu...
Anna N. Rafferty, Emma Brunskill, Thomas L. Griffi...
VTC
2010
IEEE
167views Communications» more  VTC 2010»
15 years 4 months ago
The Impact of Fading on the Outage Probability in Cognitive Radio Networks
Abstract--This paper analyzes the outage probability in cognitive radio networks, based on the Poisson point process model of node spatial distribution and the standard propagation...
Yaobin Wen, Sergey Loyka, Abbas Yongaçoglu