3991 search results - page 548 / 799 » Bounding homogeneous models |
130
click to vote
UAI
2003
15 years 6 months ago
2003
Collaborative filtering (CF) allows the preferences of multiple users to be pooled to make recommendations regarding unseen products. We consider in this paper the problem of onl...
127
click to vote
PUK
2000
15 years 6 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
113
click to vote
IJCAI
1997
15 years 6 months ago
1997
Motivated by the need to reason about utilities, and inspired by the success of bayesian networks in representing and reasoning about probabilities, we introduce the notion of uti...
149
Voted
UAI
2000
15 years 6 months ago
2000
We consider decentralized control of Markov decision processes and give complexity bounds on the worst-case running time for algorithms that find optimal solutions. Generalization...
140
click to vote
AIPS
2009
15 years 5 months ago
2009
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...