350 search results - page 59 / 70 » Complexity of Planning with Partial Observability |
ATAL
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we present a methodology for deciding the bidding strategy of agents participating in a significant number of simultaneous auctions, when finding an analytical sol...
LCN
1997
IEEE
13 years 12 months ago
1997
IEEE
W e investigate packet discarding schemes for TCP over ATM with UBR service. In doing so, we tested the eflective throughput of two existing schemes, Partial Pnwlcet Discard(PPD) ...
NIPS
2008
13 years 9 months ago
2008
Inspired by the hierarchical hidden Markov models (HHMM), we present the hierarchical semi-Markov conditional random field (HSCRF), a generalisation of embedded undirected Markov ...
AAAI
2006
13 years 9 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
TSMC
2008
13 years 7 months ago
2008
This paper describes several ensemble methods that combine multiple different reinforcement learning (RL) algorithms in a single agent. The aim is to enhance learning speed and fin...