Sciweavers

3874 search results - page 558 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
DATE
2002
IEEE
102views Hardware» more  DATE 2002»
15 years 9 months ago
Library Compatible Ceff for Gate-Level Timing
Accurate gate-level static timing analysis in the presence of RC loads has become an important problem for modern deep-submicron designs. Non-capacitive loads are usually analyzed...
Bernard N. Sheehan
ASPDAC
2007
ACM
132views Hardware» more  ASPDAC 2007»
15 years 8 months ago
Fast Decoupling Capacitor Budgeting for Power/Ground Network Using Random Walk Approach
- This paper proposes a fast and practical decoupling capacitor (decap) budgeting algorithm to optimize the power ground (P/G) network design. The new method adopts a modified rand...
Le Kang, Yici Cai, Yi Zou, Jin Shi, Xianlong Hong,...
CLA
2007
15 years 6 months ago
Formal Concepts as Optimal Factors in Boolean Factor Analysis: Implications and Experiments
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
Radim Belohlávek, Vilém Vychodil
NIPS
1996
15 years 5 months ago
Exploiting Model Uncertainty Estimates for Safe Dynamic Control Learning
Model learning combined with dynamic programming has been shown to be e ective for learning control of continuous state dynamic systems. The simplest method assumes the learned mod...
Jeff G. Schneider
DM
2006
91views more  DM 2006»
15 years 4 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber