Sciweavers

6111 search results - page 219 / 1223
» Time, Hardware, and Uniformity
Sort
View
CONCUR
1997
Springer
15 years 4 months ago
Probabilistic Concurrent Constraint Programming
Abstract. We extend cc to allow the specification of a discrete probability distribution for random variables. We demonstrate the expressiveness of pcc by synthesizing combinators...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
89
Voted
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
15 years 2 months ago
A maiden analysis of Longest Wait First
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always...
Jeff Edmonds, Kirk Pruhs
188
Voted
SIAMCOMP
2011
14 years 3 months ago
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
96
Voted
ASPDAC
2007
ACM
123views Hardware» more  ASPDAC 2007»
15 years 4 months ago
Coupling-aware Dummy Metal Insertion for Lithography
As integrated circuits manufacturing technology is advancing into 65nm and 45nm nodes, extensive resolution enhancement techniques (RETs) are needed to correctly manufacture a chip...
Liang Deng, Martin D. F. Wong, Kai-Yuan Chao, Hua ...
75
Voted
ASPDAC
2009
ACM
131views Hardware» more  ASPDAC 2009»
15 years 7 months ago
A 1 GHz CMOS comparator with dynamic offset control technique
− A dynamic offset control technique that employs charge compensation by timing control is proposed for comparator design in scaled CMOS technology. The analysis has
Xiaolei Zhu, Sanroku Tsukamoto, Tadahiro Kuroda