271 search results - page 39 / 55 » Bayesian Reward Filtering |
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
We describe an algorithm for perfect weighted-random sampling of a population with time complexity O(m + n) for sampling m inputs to produce n outputs. This algorithm is an increm...
128
click to vote
FLAIRS
2007
15 years 2 months ago
2007
1 This paper describes two major student projects for the artificial intelligence course – Mapping using Bayesian filter and Monte Carlo Localization. These projects are also sui...
NIPS
2001
15 years 1 months ago
2001
We present a principled and efficient planning algorithm for cooperative multiagent dynamic systems. A striking feature of our method is that the coordination and communication be...
PST
2004
15 years 1 months ago
2004
We examine the problem of determining a user's value for his/her private information. Web businesses often offer rewards, such as discounts, free downloads and website persona...
AI
2000
Springer
15 years 4 days ago
2000
Springer
Markov decisionprocesses(MDPs) haveproven to be popular models for decision-theoretic planning, but standard dynamic programming algorithms for solving MDPs rely on explicit, stat...