2566 search results - page 52 / 514 » The Online Median Problem |
COLT
2008
Springer
14 years 13 days ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
SIGCSE
1998
ACM
14 years 2 months ago
1998
ACM
On-line programming tests and examinations were administered to approximately 120 first year computer science students in order to evaluate their practical skills. We describe ou...
ECIR
2003
Springer
14 years 1 days ago
2003
Springer
Current online stores suffer from a cardinal problem. There are too many products to offer, and customers find themselves lost due to the vast selection. As opposed to traditional ...
SODA
1998
ACM
14 years 2 hour ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
MFCS
2005
Springer
14 years 4 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...