Sciweavers

641 search results - page 50 / 129
» On robust online scheduling algorithms
Sort
View
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
14 years 2 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng
GRID
2004
Springer
14 years 1 months ago
MARS: A Metascheduler for Distributed Resources in Campus Grids
Computational grids are increasingly being deployed in campus environments to provide unified access to distributed and heterogeneous resources such as clusters, storage arrays, ...
Abhijit Bose, Brian Wickman, Cameron Wood
IPSN
2007
Springer
14 years 2 months ago
Robust message-passing for statistical inference in sensor networks
Large-scale sensor network applications require in-network processing and data fusion to compute statistically relevant summaries of the sensed measurements. This paper studies di...
Jeremy Schiff, Dominic Antonelli, Alexandros G. Di...
TMC
2010
151views more  TMC 2010»
13 years 6 months ago
Exploiting and Defending Opportunistic Scheduling in Cellular Data Networks
—Third Generation (3G) cellular networks take advantage of time-varying and location-dependent channel conditions of mobile users to provide broadband services. Under fairness an...
Radmilo Racic, Denys Ma, Hao Chen, Xin Liu
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 9 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