317 search results - page 5 / 64 » Factoring logic functions using graph partitioning |
EUROPAR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decompositi...
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...
RECOMB
2005
Springer
14 years 8 months ago
2005
Springer
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
SC
1995
ACM
13 years 11 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
ICTAI
2008
IEEE
14 years 2 months ago
2008
IEEE
This paper presents a grammar-induction based approach to partitioning a Web page into several small pages while each small page fits not only spatially but also logically for mob...