Sciweavers

771 search results - page 75 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
AIED
2011
Springer
14 years 7 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...
IIE
2007
63views more  IIE 2007»
15 years 4 months ago
Investigation of Q-Learning in the Context of a Virtual Learning Environment
We investigate the possibility to apply a known machine learning algorithm of Q-learning in the domain of a Virtual Learning Environment (VLE). It is important in this problem doma...
Dalia Baziukaite
UAI
2004
15 years 5 months ago
Dynamical Systems Trees
We propose dynamical systems trees (DSTs) as a flexible model for describing multiple processes that interact via a hierarchy of aggregating processes. DSTs extend nonlinear dynam...
Andrew Howard, Tony Jebara
JAIR
2008
145views more  JAIR 2008»
15 years 4 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
ECAI
2006
Springer
15 years 7 months ago
Decision with Uncertainties, Feasibilities, and Utilities: Towards a Unified Algebraic Framework
Several formalisms exist to express and solve decision problems. Each is designed to capture different kinds of knowledge: utilities expressing preferences, uncertainties on the en...
Cédric Pralet, Gérard Verfaillie, Th...