290 search results - page 35 / 58 » Lattice-based computation of Boolean functions |
145
click to vote
VLSID
2002
IEEE
16 years 3 months ago
2002
IEEE
In this paper, a new logic synthesis method for an AND-XOR-OR type sense-amplifying PLA is proposed. An AND-XOR-OR type sense-amplifying PLA can achieve lowpower dissipation and h...
105
click to vote
ICCAD
1997
IEEE
15 years 7 months ago
1997
IEEE
High-level power estimation, when given only a high-level design specification such as a functional or RTL description, requires high-level estimation of the circuit average acti...
121
click to vote
CHARME
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
110
click to vote
MFCS
1998
Springer
15 years 7 months ago
1998
Springer
In this paper we consider the problem of characterizing optimal variable orderings for shared OBDDs of two Boolean functions fi = gi i hi, i = 1, 2, where i is an operator from th...
140
click to vote
COCO
2001
Springer
15 years 7 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...