Results 1  10
of
57,477
Circuits with Medium FanIn
, 2014
"... We consider boolean circuits in which every gate may compute an arbitrary boolean function of k other gates, for a parameter k. We give an explicit function f: {0, 1}n → {0, 1} that requires at least Ω(log2 n) noninput gates when k = 2n/3. When the circuit is restricted to being layered and depth 2 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
2, we prove a lower bound of nΩ(1) on the number of noninput gates. When the circuit is a formula with gates of fanin k, we give a lower bound Ω(n2/k logn) on the total number of gates. Our model is connected to some well known approaches to proving lower bounds in complexity theory. Optimal lower
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 514 (41 self)
 Add to MetaCart
SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential input
Unambiguous Auxiliary Pushdown Automata And SemiUnbounded FanIn Circuits
, 1995
"... Notions of unambiguity for uniform circuits and AuxPDAs are studied and related to each other. In particular, a coincidence for counting and unambiguous versions of AuxPDAs and semiunbounded fanin circuits is shown. Moreover, an improved simulation of LOGUCFL (the class of languages logspace many ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
Notions of unambiguity for uniform circuits and AuxPDAs are studied and related to each other. In particular, a coincidence for counting and unambiguous versions of AuxPDAs and semiunbounded fanin circuits is shown. Moreover, an improved simulation of LOGUCFL (the class of languages logspace many
Algebraic methods in the theory of lower bounds for boolean circuit complexity
 In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC ’87
, 1987
"... kbstr act We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fanin circuits with the given set of basic operations. In particular, we prove that depth k circuits with gates NOT, OR and MOD, where p is a prime require Ezp(O(n’)) gates ..."
Abstract

Cited by 331 (1 self)
 Add to MetaCart
kbstr act We use algebraic methods to get lower bounds for complexity of different functions based on constant depth unbounded fanin circuits with the given set of basic operations. In particular, we prove that depth k circuits with gates NOT, OR and MOD, where p is a prime require Ezp
LowPower CMOS Digital Design
 JOURNAL OF SOLIDSTATE CIRCUITS. VOL 27, NO 4. APRIL 1992 413
, 1992
"... Motivated by emerging batteryoperated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for lowpower operation are shown which use the ..."
Abstract

Cited by 570 (20 self)
 Add to MetaCart
Motivated by emerging batteryoperated applications that demand intensive computation in portable environments, techniques are investigated which reduce power consumption in CMOS digital circuits while maintaining computational throughput. Techniques for lowpower operation are shown which use
Efficient implementation of a BDD package
 In Proceedings of the 27th ACM/IEEE conference on Design autamation
, 1991
"... Efficient manipulation of Boolean functions is an important component of many computeraided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementat ..."
Abstract

Cited by 500 (9 self)
 Add to MetaCart
Efficient manipulation of Boolean functions is an important component of many computeraided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient
Locally weighted learning
 ARTIFICIAL INTELLIGENCE REVIEW
, 1997
"... This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias, ass ..."
Abstract

Cited by 594 (53 self)
 Add to MetaCart
This paper surveys locally weighted learning, a form of lazy learning and memorybased learning, and focuses on locally weighted linear regression. The survey discusses distance functions, smoothing parameters, weighting functions, local model structures, regularization of the estimates and bias
DecisionTheoretic Planning: Structural Assumptions and Computational Leverage
 JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1999
"... Planning under uncertainty is a central problem in the study of automated sequential decision making, and has been addressed by researchers in many different fields, including AI planning, decision analysis, operations research, control theory and economics. While the assumptions and perspectives ..."
Abstract

Cited by 510 (4 self)
 Add to MetaCart
or plans. Planning problems commonly possess structure in the reward and value functions used to de...
The Knowledge Level
 In International Conference on Software Engineering
, 1982
"... The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law. ..."
Abstract

Cited by 871 (1 self)
 Add to MetaCart
The copyright law of the United States (title 17, U.S. Code) governs the making of photocopies or other reproductions of copyrighted material. Any copying of this document without permission of its author may be prohibited by law.
The Architecture of Cognition
, 1983
"... Spanning seven orders of magnitude: a challenge for ..."
Abstract

Cited by 1580 (40 self)
 Add to MetaCart
Spanning seven orders of magnitude: a challenge for
Results 1  10
of
57,477