1403 search results - page 47 / 281 » About Approximations of Exponentials |
111
click to vote
DISOPT
2010
14 years 11 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
92
Voted
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
88
Voted
ICALP
2009
Springer
15 years 5 months ago
2009
Springer
We consider the problem of constructing decision trees for entity identification from a given table. The input is a table containing information about a set of entities over a fi...
102
click to vote
IJCAI
1989
15 years 8 days ago
1989
We consider a representation for temporal relations between intervals introduced by James Allen, and its associated computational or reasoning problem: given possibly indefinite ...
JAT
2006
14 years 11 months ago
2006
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...