Sciweavers

1138 search results - page 138 / 228
» Feature Markov Decision Processes
Sort
View
151
Voted
ATAL
2004
Springer
15 years 9 months ago
Learning User Preferences for Wireless Services Provisioning
The problem of interest is how to dynamically allocate wireless access services in a competitive market which implements a take-it-or-leave-it allocation mechanism. In this paper ...
George Lee, Steven Bauer, Peyman Faratin, John Wro...
147
Voted
AAAI
2006
15 years 5 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...
118
Voted
ICIS
2003
15 years 5 months ago
A Computational Approach to Compare Information Revelation Policies
Revelation policies in an e-marketplace differ in terms of the level of competitive information disseminated to participating sellers. Since sellers who repeatedly compete against...
Amy R. Greenwald, Karthik Kannan, Ramayya Krishnan
139
Voted
ICMLA
2009
15 years 1 months ago
Sensitivity Analysis of POMDP Value Functions
In sequential decision making under uncertainty, as in many other modeling endeavors, researchers observe a dynamical system and collect data measuring its behavior over time. The...
Stéphane Ross, Masoumeh T. Izadi, Mark Merc...
ATAL
2010
Springer
14 years 10 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...