744 search results - page 40 / 149 » Observations on the Decidability of Transitions |
IJCNN
2008
IEEE
14 years 3 months ago
2008
IEEE
— In this paper we address the reliability of policies derived by Reinforcement Learning on a limited amount of observations. This can be done in a principled manner by taking in...
OOPSLA
2010
Springer
13 years 7 months ago
2010
Springer
This report is a companion to the paper “Refactoring References for Library Migration” published at the ACM SIGPLAN International Conference on Systems, Programming, Languages...
PODS
2004
ACM
14 years 9 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
WWW
2010
ACM
14 years 4 months ago
2010
ACM
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
IJFCS
2008
13 years 9 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...