Sciweavers

8 search results - page 2 / 2
» Faster Teaching by POMDP Planning
Sort
View
AAAI
2010
13 years 6 months ago
Trial-Based Dynamic Programming for Multi-Agent Planning
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
VL
2007
IEEE
132views Visual Languages» more  VL 2007»
13 years 11 months ago
A Study on Applying Roles of Variables in Introductory Programming
Expert programmers possess programming knowledge, which is language independent and abstract. Still, programming is mostly taught only via constructs of a programming language and...
Pauli Byckling, Jorma Sajaniemi
ATAL
2009
Springer
13 years 11 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...