16430 search results - page 700 / 3286 » On Computable Tree Functions |
182
Voted
DAC
2003
ACM
16 years 8 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
237
Voted
AAAI
2006
15 years 8 months ago
2006
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
152
Voted
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We study deterministic extractors for bit-fixing sources (a.k.a. resilient functions) and exposure-resilient functions for small min-entropy. That is, of the n bits given as input...
213
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
177
Voted
FSTTCS
1993
Springer
15 years 11 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...