281 search results - page 53 / 57 » heuristics 2000 |
ISPD
2000
ACM
14 years 2 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
IUI
2000
ACM
14 years 2 months ago
2000
ACM
In recent years, many systems and approaches for recommending information, products or other objects have been developed. In these systems, often machine learning methods that nee...
ANTS
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
FMCAD
2000
Springer
14 years 1 months ago
2000
Springer
Image computation nds wide application in VLSI CAD, such as state reachability analysis in formal veri cation and synthesis, combinational veri cation, combinational and sequential...
ICCAD
2000
IEEE
14 years 1 months ago
2000
IEEE
ct Static timing analysis has traditionally used the PERT method for identifying the critical path of a digital circuit. Due to the influence of the slope of a signal at a particul...