63 search results - page 8 / 13 » Mean field for Markov Decision Processes: from Discrete to C... |
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
PAMI
2007
13 years 7 months ago
2007
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
JSAC
2008
13 years 6 months ago
2008
In this paper we design a cognitive radio that can coexist with multiple parallel WLAN channels while abiding by an interference constraint. The interaction between both systems is...
AAAI
2006
13 years 9 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...