Sciweavers

26 search results - page 2 / 6
» Approximation theorems for group valued functions
Sort
View
JSYML
2002
81views more  JSYML 2002»
13 years 5 months ago
Group Configurations and Germs in Simple Theories
We develop the theory of germs of generic functions in simple theories. Starting with an algebraic quadrangle (or other similar hypotheses), we obtain an "almost" generic...
Itay Ben-Yaacov
SAC
2008
ACM
13 years 4 months ago
Extending peer-to-peer networks for approximate search
This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains ...
Alain Mowat, Roman Schmidt, Michael Schumacher, Io...
JACIII
2007
99views more  JACIII 2007»
13 years 5 months ago
Asymptotic Behavior of Linear Approximations of Pseudo-Boolean Functions
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
Guoli Ding, Robert F. Lax, Peter P. Chen, Jianhua ...
IWANN
1999
Springer
13 years 9 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
13 years 3 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...