94 search results - page 7 / 19 » Boolean Function Representation Based on Disjoint-Support De... |
130
click to vote
VLSID
2002
IEEE
16 years 11 hour ago
2002
IEEE
This paper presents a novel approach for the synthesis of dynamic CMOS circuits using Domino and Nora styles. As these logic styles can implement only non-inverting logic, convent...
IJCAI
1997
15 years 29 days ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
95
Voted
ICML
1998
IEEE
16 years 13 days ago
1998
IEEE
This paper presents a new approach to hierarchical reinforcement learning based on the MAXQ decomposition of the value function. The MAXQ decomposition has both a procedural seman...
DAC
2003
ACM
16 years 18 days ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
141
click to vote
CC
2010
Springer
14 years 10 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...