3050 search results - page 210 / 610 » On-line Algorithms in Machine Learning |
148
click to vote
ML
2006
ACM
15 years 4 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
167
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...
138
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
137
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
An anytime algorithm is capable of returning a response to the given task at essentially any time; typically the quality of the response improves as the time increases. Here, we c...
132
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
We present a Bayesian search algorithm for learning the structure of latent variable models of continuous variables. We stress the importance of applying search operators designed...