1120 search results - page 80 / 224 » Eager Markov Chains |
250
click to vote
CORR
2010
Springer
15 years 20 days ago
2010
Springer
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
191
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Most work on wireless network throughput ignores the temporal correlation inherent to wireless channels because it degrades tractability. To better model and quantify the temporal...
255
click to vote
FOGA
2011
14 years 9 months ago
2011
The Vose dynamical system model of the simple genetic algorithm models the behavior of this algorithm for large population sizes and is the basis of the exact Markov chain model. ...
345
click to vote
SAC
2011
ACM
14 years 9 months ago
2011
ACM
Slice sampling provides an easily implemented method for constructing a Markov chain Monte Carlo (MCMC) algorithm. However, slice sampling has two major drawbacks: (i) it requires...
226
click to vote
TKDE
2011
15 years 1 months ago
2011
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...