Sciweavers

766 search results - page 32 / 154
» Online Variance Minimization
Sort
View
IPL
2008
114views more  IPL 2008»
14 years 11 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
IPL
2007
113views more  IPL 2007»
14 years 11 months ago
Greedy online frequency allocation in cellular networks
The online frequency allocation problem for cellular networks has been well studied in these years. Given a mobile telephone network, whose geographical coverage area is divided i...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
ESA
2004
Springer
151views Algorithms» more  ESA 2004»
15 years 3 months ago
On Variable-Sized Multidimensional Packing
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
Leah Epstein, Rob van Stee
JACIII
2008
75views more  JACIII 2008»
14 years 11 months ago
I3P: A Protocol for Increasing Reliability and Responsiveness in Massively Multiplayer Games
Developing broadband and internet technologies offers possibilities for new ways of minimizing the server bottleneck in online gaming as well as an increase in response and reliab...
Jeremy Kackley, Matthew Gambrell, Jean Gourd
EOR
2008
52views more  EOR 2008»
14 years 12 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao