18 search results - page 4 / 4 » Computational Algorithm for Higher Order Legendre Polynomial... |
DAC
2006
ACM
14 years 6 months ago
2006
ACM
For statistical timing and power analysis that are very important problems in the sub-100nm technologies, stochastic analysis of power grids that characterizes the voltage fluctua...
JGO
2010
13 years 3 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
GLVLSI
2006
IEEE
13 years 11 months ago
2006
IEEE
Process technology and environment-induced variability of gates and wires in VLSI circuits make timing analyses of such circuits a challenging task. Process variation can have a s...