3049 search results - page 158 / 610 » On the Convergence of Bound Optimization Algorithms |
182
click to vote
AAAI
2012
13 years 8 months ago
2012
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
180
click to vote
ML
2007
ACM
15 years 6 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
166
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
This paper shows that the minimum ratio canceling algorithm of Wallacher (1989) (and a faster relaxed version) can be generalized to an algorithm for general linear programs with ...
165
click to vote
CNSR
2007
IEEE
15 years 8 months ago
2007
IEEE
Wireless sensor networks have mainly been designed for information-collecting purposes, such as habitat monitoring, product process tracing, battlefield surveillance, etc. In orde...
161
click to vote
TPDS
1998
15 years 6 months ago
1998
—A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found ...