8824 search results - page 76 / 1765 » On the Complexity of Real Functions |
134
click to vote
AIR
2005
15 years 3 months ago
2005
The paradox of fuzzy modeling is recognized due to the co-existence of its effectiveness of solving uncertain problems in the real world and the skepticism of its reasonability in ...
104
click to vote
DAM
2008
15 years 4 months ago
2008
Sauer's Lemma is extended to classes HN of binary-valued functions h on [n] = {1, . . . , n} which have a margin less than or equal to N on all x [n] with h(x) = 1, where th...
131
click to vote
FCT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In the paper we show that there is a close relationship between the energy complexity and the depth of threshold circuits computing any Boolean function although they hav...
119
click to vote
FPCA
1989
15 years 8 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
118
click to vote
MFCS
1993
Springer
15 years 8 months ago
1993
Springer
We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substant...