Sciweavers

159 search results - page 28 / 32
» Data-Driven Performance Analysis of Scheduled Processes
Sort
View
IOR
2002
135views more  IOR 2002»
14 years 10 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
PIMRC
2008
IEEE
15 years 4 months ago
Network-Assisted Wireless Computing
Abstract—Multimedia applications for mobile devices are increasing and growing more sophisticated. Many of these applications require computationally intensive processing, such a...
Carri W. Chan, Nicholas Bambos, Jatinder Pal Singh
ADHOCNETS
2009
Springer
15 years 24 days ago
Efficient Distribution of Large Files in UMTS Supported by Network Coded M2M Data Transfer with Multiple Generations
This paper is a sequel of previous work, in which we have studied the traffic management problem in UMTS. The main objective was to improve the spectral efficiency of cellular netw...
Larissa Popova, Wolfgang H. Gerstacker, Wolfgang K...
ASPLOS
2010
ACM
15 years 5 months ago
Request behavior variations
A large number of user requests execute (often concurrently) within a server system. A single request may exhibit fluctuating hardware characteristics (such as instruction comple...
Kai Shen
97
Voted
TWC
2008
133views more  TWC 2008»
14 years 10 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...