317 search results - page 11 / 64 » Factoring logic functions using graph partitioning |
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
ICFP
2012
ACM
11 years 10 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
PC
2007
13 years 7 months ago
2007
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
KR
2004
Springer
14 years 1 months ago
2004
Springer
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...