Sciweavers

1997 search results - page 51 / 400
» On the convergence of Hill's method
Sort
View
98
Voted
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
15 years 7 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber
102
Voted
GECCO
2004
Springer
126views Optimization» more  GECCO 2004»
15 years 6 months ago
A Gene Based Adaptive Mutation Strategy for Genetic Algorithms
In this study, a new mechanism that adapts the mutation rate for each locus on the chromosomes, based on feedback obtained from the current population is proposed. Through tests us...
Sima Uyar, Sanem Sariel, Gülsen Eryigit
AMC
2005
168views more  AMC 2005»
15 years 17 days ago
Comparison between the homotopy analysis method and homotopy perturbation method
In this paper, we show that the so-called ``homotopy perturbation method'' is only a special case of the homotopy analysis method. Both methods are in principle based on...
Shijun Liao
104
Voted
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 7 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
78
Voted
MCS
2007
Springer
15 years 16 days ago
SpectrUW: A laboratory for the numerical exploration of spectra of linear operators
Spectra of linear operators play an important role in various aspects of applied mathematics. For all but the simplest operators, the spectrum cannot be determined analytically an...
Bernard Deconinck, Firat Kiyak, John D. Carter, J....