Sciweavers

36 search results - page 4 / 8
» Accelerated Genetic Algorithms with Markov Chains
Sort
View
WWW
2005
ACM
15 years 10 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry
76
Voted
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
14 years 10 months ago
Threshold selecting: best possible probability distribution for crossover selection in genetic algorithms
The paper considers the problem of selecting individuals in the current population in Genetic Algorithms for crossover to find a solution of high fitness of a given combinatoria...
Jörg Lässig, Karl Heinz Hoffmann, Mihael...
87
Voted
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 2 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
ICCS
2007
Springer
15 years 3 months ago
Complexity of Monte Carlo Algorithms for a Class of Integral Equations
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the ...
Ivan Dimov, Rayna Georgieva
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
15 years 1 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...