Sciweavers

682 search results - page 103 / 137
» One-Counter Markov Decision Processes
Sort
View
123
Voted
AAAI
2006
15 years 2 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...
98
Voted
ICIS
2003
15 years 2 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
88
Voted
GECCO
2005
Springer
152views Optimization» more  GECCO 2005»
15 years 6 months ago
GAMM: genetic algorithms with meta-models for vision
Recent adaptive image interpretation systems can reach optimal performance for a given domain via machine learning, without human intervention. The policies are learned over an ex...
Greg Lee, Vadim Bulitko
109
Voted
WISE
2002
Springer
15 years 5 months ago
An MDP-based Peer-to-Peer Search Server Network
A distributed search system consists of a large number of autonomous search servers logically connected in a peerto-peer network. Each search server maintains a local index of a c...
Yipeng Shen, Dik Lun Lee
ATAL
2009
Springer
15 years 7 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...