2607 search results - page 47 / 522 » Complete Functional Synthesis |
113
Voted
COMBINATORICS
2002
15 years 2 months ago
2002
If G = Kn is the complete graph, the classical Pr
145
click to vote
ICCAD
2007
IEEE
15 years 11 months ago
2007
IEEE
Functional dependency is concerned with rewriting a Boolean function f as a function h over a set of base functions {g1, …, gn}, i.e. f = h(g1, …, gn). It plays an important r...
119
Voted
CSB
2005
IEEE
15 years 8 months ago
2005
IEEE
Annotation of protein function often arises in the context of partially complete genomes but is not adequately addressed. We present an annotation method by extracting ortholog cl...
113
click to vote
CP
2005
Springer
15 years 8 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
124
click to vote
DAC
2008
ACM
16 years 3 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...