62 search results - page 5 / 13 » Generalized cofactoring for logic function evaluation |
PPDP
2007
Springer
14 years 1 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
OOPSLA
2005
Springer
14 years 26 days ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
ICDM
2006
IEEE
14 years 1 months ago
2006
IEEE
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...
GLVLSI
2010
IEEE
14 years 14 days ago
2010
IEEE
NBTI is one of the most important silicon reliability problems facing processor designers today. The impact of NBTI can be mitigated at both the circuit and microarchitecture leve...
CC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...