Sciweavers

220 search results - page 18 / 44
» Minimizing Average Flow-time : Upper and Lower Bounds
Sort
View
ICCAD
2009
IEEE
161views Hardware» more  ICCAD 2009»
13 years 4 months ago
The epsilon-approximation to discrete VT assignment for leakage power minimization
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
Yujia Feng, Shiyan Hu
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 6 months ago
On Optimum Power Allocation for the V-BLAST
—A unified analytical framework for optimum power allocation in the unordered V-BLAST algorithm and its comparative performance analysis are presented. Compact closed-form appro...
Victoria Kostina, Sergey Loyka
UAI
2008
13 years 8 months ago
Bounds on the Bethe Free Energy for Gaussian Networks
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
Botond Cseke, Tom Heskes
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
14 years 3 days ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
VTC
2007
IEEE
133views Communications» more  VTC 2007»
14 years 1 months ago
Decode-and-Forward Cooperative Networks with Relay Selection
— In this paper, we focus on the diversity order of the decode-and-forward (DF) cooperative networks with relay selection. Many detection schemes have been proposed for the DF; b...
Zhihang Yi, Il-Min Kim