152 search results - page 7 / 31 » Hardware Software Partitioning with Iterative Improvement He... |
ICCD
2002
IEEE
14 years 4 months ago
2002
IEEE
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
— A method for timing driven placement is presented. The core of the approach is optimal timing-driven relaxed placement based on a linear programming (LP) formulation. The formu...
ACMMSP
2004
ACM
14 years 27 days ago
2004
ACM
Irregular applications frequently exhibit poor performance on contemporary computer architectures, in large part because of their inefficient use of the memory hierarchy. Runtime ...
ICCAD
1997
IEEE
13 years 11 months ago
1997
IEEE
An algorithm that remains in use at the core of many partitioning systems is the Kernighan-Lin algorithm and a variant the Fidducia-Matheysses (FM) algorithm. To understand the FM...