Sciweavers

2822 search results - page 312 / 565
» Global Optimization of Histograms
Sort
View
TCS
2008
15 years 6 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
AMC
2004
115views more  AMC 2004»
15 years 6 months ago
Performance comparison of memetic algorithms
Local search techniques have been applied in optimization methods. The effect of local search to the memetic algorithms can make multimodal and non-linear problems easier to solve...
Jason G. Digalakis, Konstantinos G. Margaritis
CCE
2004
15 years 6 months ago
Balanced random interval arithmetic
The results of experimental testing of balanced random interval arithmetic with typical mathematical test functions and practical problem are presented and discussed. The possibili...
Julius Zilinskas, Ian David Lockhart Bogle
CORR
2000
Springer
99views Education» more  CORR 2000»
15 years 6 months ago
Adaptive simulated annealing (ASA): Lessons learned
Adaptive simulated annealing (ASA) is a global optimization algorithm based on an associated proof that the parameter space can be sampled much more efficiently than by using othe...
Lester Ingber
TSMC
2002
119views more  TSMC 2002»
15 years 6 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore