5214 search results - page 68 / 1043 » The Online Specialization Problem |
SODA
1998
ACM
13 years 9 months 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 1 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...
ACMACE
2005
ACM
14 years 1 months ago
2005
ACM
We study the problem of restricting participation in online games to human players, so they can enjoy the game without interference from automated playing agents known as bots. We...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— The application of on-line learning techniques to modern computer games is a promising research direction. In fact, they can be used to improve the game experience and to achie...
COR
2011
13 years 2 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...