Sciweavers

253 search results - page 33 / 51
» Approximation algorithm for the temperature-aware scheduling...
Sort
View
APPROX
2009
Springer
163views Algorithms» more  APPROX 2009»
15 years 8 months ago
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
José R. Correa, Martin Skutella, José...
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 5 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
15 years 8 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
INFOCOM
2009
IEEE
15 years 8 months ago
Downlink MIMO with Frequency-Domain Packet Scheduling for 3GPP LTE
—This paper addresses the problem of frequency domain packet scheduling (FDPS) incorporating spatial division multiplexing (SDM) multiple input multiple output (MIMO) techniques ...
Suk-Bok Lee, Sayantan Choudhury, Ahmad Khoshnevis,...
IPPS
2009
IEEE
15 years 8 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...