Sciweavers

26071 search results - page 5214 / 5215
» Making the
Sort
View
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
11 years 8 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
11 years 8 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
PODC
2012
ACM
11 years 8 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
HPDC
2012
IEEE
11 years 8 months ago
vSlicer: latency-aware virtual machine scheduling via differentiated-frequency CPU slicing
Recent advances in virtualization technologies have made it feasible to host multiple virtual machines (VMs) in the same physical host and even the same CPU core, with fair share ...
Cong Xu, Sahan Gamage, Pawan N. Rao, Ardalan Kanga...
DAC
2005
ACM
14 years 6 months ago
OPERA: optimization with ellipsoidal uncertainty for robust analog IC design
As the d esig n-m anu factu ring interface becom es increasing ly com plicated with IC technolog y scaling , the correspond ing process variability poses g reat challeng es for na...
Yang Xu, Kan-Lin Hsiung, Xin Li, Ivan Nausieda, St...
« Prev « First page 5214 / 5215 Last » Next »