3096 search results - page 436 / 620 » The Generalized FITC Approximation |
187
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
170
click to vote
NIPS
1993
15 years 7 months ago
1993
Recent developments in the area of reinforcement learning have yielded a number of new algorithms for the prediction and control of Markovian environments. These algorithms,includ...
185
click to vote
NIPS
1990
15 years 7 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
269
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
170
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...