3096 search results - page 334 / 620 » The Generalized FITC Approximation |
145
click to vote
WSC
2004
15 years 8 months ago
2004
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
186
click to vote
WSCG
2004
15 years 8 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
180
click to vote
SIP
2003
15 years 8 months ago
2003
This paper presents an efficient method for designing full band IIR digital differentiators in the complex Chebyshev sense. The proposed method is based on the formulation of a g...
139
click to vote
IPCO
1996
15 years 8 months ago
1996
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2(...
206
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...