Sciweavers

10054 search results - page 191 / 2011
» On the Complexity of Function Learning
Sort
View
129
Voted
CORR
2010
Springer
139views Education» more  CORR 2010»
14 years 7 months ago
A recombination algorithm for the decomposition of multivariate rational functions
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
Guillaume Chèze
81
Voted
IJCNN
2000
IEEE
15 years 5 months ago
Taxonomy of Neural Transfer Functions
The choice of transfer functions may strongly influence complexity and performance of neural networks used in classification and approximation tasks. A taxonomy of activation an...
Wlodzislaw Duch, Norbert Jankowski
93
Voted
ECTEL
2010
Springer
14 years 10 months ago
Demands of Modern PLEs and the ROLE Approach
Abstract. We present basic concepts and an outlook on current approaches and techniques of personal learning environments to point out their demands, focussing on recommendations i...
Uwe Kirschenmann, Maren Scheffel, Martin Friedrich...
106
Voted
ICML
1995
IEEE
16 years 1 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
ICRA
1994
IEEE
105views Robotics» more  ICRA 1994»
15 years 4 months ago
Harmonic Functions and Collision Probabilities
There is a close relationship between harmonic functions { which have recently been proposed for path planning { and hitting probabilities for random processes. The hitting probab...
Christopher I. Connolly