Sciweavers

539 search results - page 98 / 108
» An Improved Upper Bound for SAT
Sort
View
DAC
2006
ACM
14 years 10 months ago
Statistical timing based on incomplete probabilistic descriptions of parameter uncertainty
Existing approaches to timing analysis under uncertainty are based on restrictive assumptions. Statistical STA techniques assume that the full probabilistic distribution of parame...
Wei-Shen Wang, Vladik Kreinovich, Michael Orshansk...
PODC
2009
ACM
14 years 9 months ago
Max registers, counters, and monotone circuits
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
James Aspnes, Hagit Attiya, Keren Censor
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 9 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
PERCOM
2007
ACM
14 years 8 months ago
Data Quality and Query Cost in Wireless Sensor Networks
This research is motivated by emerging, real-world wireless sensor network applications for monitoring and control. We examine the benefits and costs of caching data for such appli...
David J. Yates, Erich M. Nahum, Jim Kurose, Prasha...
ISPD
2010
ACM
195views Hardware» more  ISPD 2010»
14 years 3 months ago
Density gradient minimization with coupling-constrained dummy fill for CMP control
In the nanometer IC design, dummy fill is often performed to improve layout pattern uniformity and the post-CMP quality. However, filling dummies might greatly increase intercon...
Huang-Yu Chen, Szu-Jui Chou, Yao-Wen Chang