Sciweavers

1008 search results - page 30 / 202
» Minimizing Average Flow-Time
Sort
View
IR
2010
13 years 8 months ago
Gradient descent optimization of smoothed information retrieval metrics
Abstract Most ranking algorithms are based on the optimization of some loss functions, such as the pairwise loss. However, these loss functions are often different from the criter...
Olivier Chapelle, Mingrui Wu
ICCAD
2009
IEEE
98views Hardware» more  ICCAD 2009»
13 years 7 months ago
A rigorous framework for convergent net weighting schemes in timing-driven placement
We present a rigorous framework that defines a class of net weighting schemes in which unconstrained minimization is successively performed on a weighted objective. We show that, ...
Tony F. Chan, Jason Cong, Eric Radke
IPL
2011
91views more  IPL 2011»
13 years 1 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
ICDE
2010
IEEE
198views Database» more  ICDE 2010»
14 years 9 months ago
Q-Cop: Avoiding Bad Query Mixes to Minimize Client Timeouts Under Heavy Loads
In three-tiered web applications, some form of admission control is required to ensure that throughput and response times are not significantly harmed during periods of heavy load....
Sean Tozer, Tim Brecht, Ashraf Aboulnaga
FCCM
2007
IEEE
129views VLSI» more  FCCM 2007»
14 years 4 months ago
Automatic On-chip Memory Minimization for Data Reuse
FPGA-based computing engines have become a promising option for the implementation of computationally intensive applications due to high flexibility and parallelism. However, one...
Qiang Liu, George A. Constantinides, Konstantinos ...