Sciweavers

10289 search results - page 161 / 2058
» Standard bases in K
Sort
View
JCO
2010
99views more  JCO 2010»
15 years 4 months ago
Online scheduling with a buffer on related machines
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
György Dósa, Leah Epstein
SIGMETRICS
2000
ACM
111views Hardware» more  SIGMETRICS 2000»
15 years 6 months ago
AMVA techniques for high service time variability
Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the &qu...
Derek L. Eager, Daniel J. Sorin, Mary K. Vernon
ASPDAC
2007
ACM
97views Hardware» more  ASPDAC 2007»
15 years 10 months ago
A Wideband CMOS LC-VCO Using Variable Inductor
This paper proposes a wide-range tunable CMOS voltage controlled oscillator (VCO). VCO uses an on-chip variable inductor and switched capacitors as variable elements. The VCO was f...
K. Ohashi, Y. Ito, Yoshiaki Yoshihara, Kenichi Oka...
DGO
2007
140views Education» more  DGO 2007»
15 years 7 months ago
Governing with information technologies
This paper outlines the project highlights for the research project, Governing with Information Technologies. Categories and Subject Descriptors K.4.1 [Computers and Society]: Pub...
Rajiv C. Shah, Jay P. Kesan
CORR
2008
Springer
104views Education» more  CORR 2008»
15 years 6 months ago
The Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
Bobak Nazer, Michael Gastpar