8824 search results - page 96 / 1765 » On the Complexity of Real Functions |
120
click to vote
FOCS
1991
IEEE
15 years 7 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
135
click to vote
CCA
2009
Springer
15 years 10 months ago
2009
Springer
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...
106
click to vote
MOC
2002
15 years 3 months ago
2002
Abstract. In this paper, we are interested in the evaluation of the zeta function of the simplest cubic field. We first introduce Siegel's formula for values of the zeta funct...
139
click to vote
PPSN
2004
Springer
15 years 9 months ago
2004
Springer
This article describes a new model of probability density function and its use in estimation of distribution algorithms. The new model, the distribution tree, has interesting prope...
142
click to vote
RTAS
2000
IEEE
15 years 8 months ago
2000
IEEE
—Many embedded systems operate under severe power and energy constraints. Voltage clock scaling is one mechanism by which energy consumption may be reduced: It is based on the fa...