4255 search results - page 82 / 851 » On Learning Boolean Functions |
STOC
1999
ACM
15 years 2 months ago
1999
ACM
In this paper we prove a theorem that gives an (almost) tight upper bound on the sensitivity of a multiple-output Boolean function in terms of the sensitivity of its coordinates an...
AHS
2006
IEEE
15 years 3 months ago
2006
IEEE
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...
DATE
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we present a method which allows the statistical analysis of nanoelectronic Boolean networks with respect to timing uncertainty and noise. All signals are considered...
LPAR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...
ICMCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Software tools for personal photo collection management are proliferating, but they usually have limited searching and browsing functions. We implemented the PhotoFinder prototype...