Sciweavers

6142 search results - page 410 / 1229
» The Complexity of Partition Functions
Sort
View
DAGSTUHL
2004
15 years 8 months ago
Optimal algorithms for global optimization in case of unknown Lipschitz constant
We consider the global optimization problem for d-variate Lipschitz functions which, in a certain sense, do not increase too slowly in a neighborhood of the global minimizer(s). O...
Matthias U. Horn
CORR
2008
Springer
112views Education» more  CORR 2008»
15 years 6 months ago
Capacity of General Discrete Noiseless Channels
This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discre...
Georg Böcherer, Valdemar Cardoso da Rocha Jr....
MOR
2006
95views more  MOR 2006»
15 years 6 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
AUTOMATICA
2005
137views more  AUTOMATICA 2005»
15 years 6 months ago
Multivariable frequency-response curve fitting with application to modal parameter estimation
This paper presents a computational approach for the frequency-domain identification of multivariable, discrete-time transfer function models based on a cost function minimization...
P. Verboven, P. Guillaume, B. Cauberghe
IVC
2007
90views more  IVC 2007»
15 years 6 months ago
Numerical residues
Binary morphological transformations based on the residues (ultimate erosion, skeleton by openings, etc.) are extended to functions by means of the transformation definition and o...
Serge Beucher