641 search results - page 85 / 129 » Branch and Bound Algorithm Selection by Performance Predicti... |
144
click to vote
ATAL
2011
Springer
14 years 1 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
105
Voted
COLT
2004
Springer
15 years 7 months ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
143
click to vote
IDA
2010
Springer
15 years 9 days ago
2010
Springer
Stacking is a widely used technique for combining classifiers and improving prediction accuracy. Early research in Stacking showed that selecting the right classifiers, their par...
120
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Co-evolution is the process in which two (or more) sets of orthologs exhibit a similar or correlative pattern of evolution. Co-evolution is a powerful way to learn abo...
125
click to vote
COLT
2005
Springer
15 years 3 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...