1438 search results - page 217 / 288 » A general formalism for the analysis of distributed algorith... |
COLT
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of finding the best arm in a stochastic multi-armed bandit game. The regret of a forecaster is here defined by the gap between the mean reward of the optim...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
BMCBI
2004
13 years 7 months ago
2004
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
PODC
2003
ACM
14 years 1 months ago
2003
ACM
All too often a seemingly insurmountable divide between theory and practice can be witnessed. In this paper we try to contribute to narrowing this gap in the field of ad-hoc rout...
BMCBI
2010
13 years 8 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...