Sciweavers

14 search results - page 2 / 3
» An approximation algorithm for labelled Markov processes: to...
Sort
View
ATAL
2009
Springer
13 years 11 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...
AIPS
2008
13 years 7 months ago
Multiagent Planning Under Uncertainty with Stochastic Communication Delays
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...
Matthijs T. J. Spaan, Frans A. Oliehoek, Nikos A. ...
AAAI
2008
13 years 7 months ago
Towards Faster Planning with Continuous Resources in Stochastic Domains
Agents often have to construct plans that obey resource limits for continuous resources whose consumption can only be characterized by probability distributions. While Markov Deci...
Janusz Marecki, Milind Tambe
ATAL
2010
Springer
13 years 6 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham
ICIP
1999
IEEE
14 years 6 months ago
Color Documents on the Web with DJVU
We present a new image compression technique called DjVu" that is speci cally geared towards the compression of scanned documents in color at high resolution. With DjVu, a ma...
Bill Riemers, Léon Bottou, Pascal Vincent, ...