Sciweavers

4446 search results - page 651 / 890
» Learning Observer Agents
Sort
View
AAAI
2006
15 years 6 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
147
Voted
AAAI
2006
15 years 6 months ago
Improving Approximate Value Iteration Using Memories and Predictive State Representations
Planning in partially-observable dynamical systems is a challenging problem, and recent developments in point-based techniques such as Perseus significantly improve performance as...
Michael R. James, Ton Wessling, Nikos A. Vlassis
AAAI
2006
15 years 6 months ago
Incremental Least Squares Policy Iteration for POMDPs
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
Hui Li, Xuejun Liao, Lawrence Carin
AAAI
2006
15 years 6 months ago
Spinning Multiple Social Networks for Semantic Web
Social networks are important for the Semantic Web. Several means can be used to obtain social networks: using social networking services, aggregating Friendof-a-Friend (FOAF) doc...
Yutaka Matsuo, Masahiro Hamasaki, Yoshiyuki Nakamu...
159
Voted
AAAI
2006
15 years 6 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...