Sciweavers

1008 search results - page 17 / 202
» Minimizing Average Flow-Time
Sort
View
TCAD
1998
126views more  TCAD 1998»
13 years 9 months ago
Iterative remapping for logic circuits
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
Luca Benini, Patrick Vuillod, Giovanni De Micheli
INFOCOM
2012
IEEE
12 years 8 days ago
Delay and rate-optimal control in a multi-class priority queue with adjustable service rates
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...
Chih-Ping Li, Michael J. Neely
SIGIR
2006
ACM
14 years 3 months ago
Minimal test collections for retrieval evaluation
Accurate estimation of information retrieval evaluation metrics such as average precision require large sets of relevance judgments. Building sets large enough for evaluation of r...
Ben Carterette, James Allan, Ramesh K. Sitaraman
TECS
2002
81views more  TECS 2002»
13 years 9 months ago
System-level exploration of association table implementations in telecom network applications
les to further raise the abstraction level of the initial specification, where dynamic data sets can be specified without low-level details. Our method is suited for hardware and s...
Chantal Ykman-Couvreur, J. Lambrecht, A. Van Der T...
JCO
1998
80views more  JCO 1998»
13 years 9 months ago
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
Cynthia A. Phillips, Andreas S. Schulz, David B. S...