1541 search results - page 273 / 309 » Analysis of Random Noise and Random Walk Algorithms |
124
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
115
Voted
SODA
1997
ACM
15 years 3 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
124
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
117
click to vote
GECCO
2009
Springer
15 years 6 months ago
2009
Springer
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
113
click to vote
EOR
2007
15 years 1 months ago
2007
The motivation of this paper is to obtain an analytical closed form of a quadratic objective function arising from a stochastic decision process with bivariate exponential probabi...