Sciweavers

76 search results - page 9 / 16
» Lower bounds for adaptive linearity tests
Sort
View
DATE
2003
IEEE
116views Hardware» more  DATE 2003»
15 years 2 months ago
Statistical Timing Analysis Using Bounds
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
Aseem Agarwal, David Blaauw, Vladimir Zolotov, Sar...
172
Voted
ICLP
2009
Springer
15 years 10 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
NIPS
2007
14 years 11 months ago
Adaptive Online Gradient Descent
We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori k...
Peter L. Bartlett, Elad Hazan, Alexander Rakhlin
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 3 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
69
Voted
RTCSA
2007
IEEE
15 years 3 months ago
Virtual Full Replication by Adaptive Segmentation
We propose Virtual Full Replication by Adaptive segmentation (ViFuR-A), and evaluate its ability to maintain scalability in a replicated real-time database. With full replication ...
Gunnar Mathiason, Sten F. Andler, Sang Hyuk Son