Sciweavers

287 search results - page 35 / 58
» Optimal Histograms with Quality Guarantees
Sort
View
SIAMDM
2002
124views more  SIAMDM 2002»
13 years 9 months ago
Scheduling Unrelated Machines by Randomized Rounding
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
Andreas S. Schulz, Martin Skutella
VLDB
2007
ACM
103views Database» more  VLDB 2007»
14 years 10 months ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa
ICC
2007
IEEE
103views Communications» more  ICC 2007»
14 years 4 months ago
A More Realistic Approach to Information-Theoretic Sum Capacity of Reverse Link CDMA Systems in a Single Cell
— In this paper, we discuss the information–theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate cap...
Arash Abadpour, Attahiru Sule Alfa, Anthony C. K. ...
ISLPED
2007
ACM
123views Hardware» more  ISLPED 2007»
13 years 11 months ago
Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules
We address power minimization of earliest deadline first and ratemonotonic schedules by voltage and frequency scaling. We prove that the problems are NP-hard, and present (1+ ) f...
Sushu Zhang, Karam S. Chatha, Goran Konjevod
IFIP12
2004
13 years 11 months ago
A Decision Support System (DSS) for the Railway Scheduling Problem
The recent deregulation occurred in the public railway sector in many parts of the world has increased the awareness of this sector of the need for quality service that must be oer...
Laura Paola Ingolotti, María Pilar Tormos, ...