Sciweavers

554 search results - page 109 / 111
» Approximability of OFDMA Scheduling
Sort
View
ANSS
1996
IEEE
15 years 1 months ago
Computation of the Asymptotic Bias and Variance for Simulation of Markov Reward Models
The asymptotic bias and variance are important determinants of the quality of a simulation run. In particular, the asymptotic bias can be used to approximate the bias introduced b...
Aad P. A. van Moorsel, Latha A. Kant, William H. S...
PPSN
2000
Springer
15 years 1 months ago
Optimizing through Co-evolutionary Avalanches
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
14 years 11 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
14 years 11 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu
MANSCI
2008
119views more  MANSCI 2008»
14 years 9 months ago
Service-Level Differentiation in Call Centers with Fully Flexible Servers
We study large-scale service systems with multiple customer classes and many statistically identical servers. The following question is addressed: How many servers are required (s...
Itay Gurvich, Mor Armony, Avishai Mandelbaum