4164 search results - page 488 / 833 » Timing model reduction for hierarchical timing analysis |
182
click to vote
JIT
2004
Springer
16 years 5 days ago
2004
Springer
Software product lines (PLs) present a solid approach in large scale reuse. Due to the PLs’ inherit complexity, many PL methods use the notion of ”features” to support requir...
182
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
184
click to vote
FTEDA
2006
15 years 6 months ago
2006
As IC technologies scale to finer feature sizes, it becomes increasingly difficult to control the relative process variations. The increasing fluctuations in manufacturing process...
178
click to vote
ACSAC
2004
IEEE
15 years 10 months ago
2004
IEEE
Since attackers trust computer systems to tell them the truth, it may be effective for those systems to lie or mislead. This could waste the attacker's resources while permit...
197
click to vote
IPL
2011
14 years 10 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...