1403 search results - page 202 / 281 » About Approximations of Exponentials |
184
click to vote
WSC
2007
15 years 8 months ago
2007
Statistical selection procedures can identify the best of a finite set of alternatives, where “best” is defined in terms of the unknown expected value of each alternative’...
164
click to vote
IJCAI
2007
15 years 7 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
176
click to vote
NIPS
2007
15 years 7 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
162
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
195
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a new approach to value function approximation which combines linear temporal difference reinforcement learning with subspace identification. In practical applications...