6251 search results - page 916 / 1251 » Randomness, Computability, and Density |
196
click to vote
MFCS
2010
Springer
15 years 6 months ago
2010
Springer
We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with parity objectives. An observationbased strategy relies on partial information...
230
click to vote
PKDD
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Bayesian reinforcement learning (RL) is aimed at making more efficient use of data samples, but typically uses significantly more computation. For discrete Markov Decis...
228
click to vote
SIAMCO
2010
15 years 5 months ago
2010
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...
201
click to vote
ACL
2010
15 years 5 months ago
2010
Conditional Random Fields (CRFs) are a widely-used approach for supervised sequence labelling, notably due to their ability to handle large description spaces and to integrate str...
200
click to vote
IPPS
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--Software transactional memory (STM) algorithms often rely on centralized components to achieve atomicity, isolation and consistency. In a distributed setting, centralized...