Sciweavers

2354 search results - page 321 / 471
» Randomness, Stochasticity and Approximations
Sort
View
172
Voted
AE
2005
Springer
15 years 11 months ago
Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
Anne Auger, Mohamed Jebalia, Olivier Teytaud
178
Voted
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 11 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom
COLT
2004
Springer
15 years 11 months ago
Convergence of Discrete MDL for Sequential Prediction
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
Jan Poland, Marcus Hutter
178
Voted
INFOCOM
2003
IEEE
15 years 11 months ago
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
— A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data ...
Seema Bandyopadhyay, Edward J. Coyle
ICALP
2003
Springer
15 years 11 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper