1612 search results - page 254 / 323 » Analysing Randomized Distributed Algorithms |
NIPS
2001
14 years 11 months ago
2001
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
84
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the ...
102
click to vote
INFORMATICALT
2008
14 years 9 months ago
2008
Abstract. Data stream mining has become a novel research topic of growing interest in knowledge discovery. Most proposed algorithms for data stream mining assume that each data blo...
ITA
2006
14 years 9 months ago
2006
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...