2252 search results - page 242 / 451 » Lower Bounds for Dynamic Algorithms |
117
Voted
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
—This paper describes efficient utilization of human time by two means: prioritization of human tasks and maximizing multirobot team size. We propose an efficient scheduling algo...
109
click to vote
STOC
1993
ACM
15 years 7 months ago
1993
ACM
We analyze algorithms that predict a binary value by combining the predictions of several prediction strategies, called experts. Our analysis is for worst-case situations, i.e., we...
163
click to vote
COLT
2010
Springer
15 years 1 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
Voted
AAAI
2012
13 years 6 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...
142
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...