Sciweavers

10051 search results - page 153 / 2011
» A Dynamic Separator Algorithm
Sort
View
IPPS
1996
IEEE
15 years 5 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
88
Voted
ICANN
2009
Springer
15 years 7 months ago
Algorithms for Structural and Dynamical Polychronous Groups Detection
Polychronization has been proposed as a possible way to investigate the notion of cell assemblies and to understand their role as memory supports for information coding. In a spiki...
Régis Martinez, Hélène Paugam...
87
Voted
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
15 years 7 months ago
Learning and anticipation in online dynamic optimization with evolutionary algorithms: the stochastic case
The focus of this paper is on how to design evolutionary algorithms (EAs) for solving stochastic dynamic optimization problems online, i.e. as time goes by. For a proper design, t...
Peter A. N. Bosman, Han La Poutré
IPPS
2006
IEEE
15 years 6 months ago
Parallel implementation of the replica exchange molecular dynamics algorithm on Blue Gene/L
The Replica Exchange method is a popular approach for studying the folding thermodynamics of small to modest size proteins in explicit solvent, since it is easily parallelized. Ho...
Maria Eleftheriou, Aleksandr Rayshubskiy, Jed W. P...
100
Voted
EVOW
2005
Springer
15 years 6 months ago
Assortative Mating in Genetic Algorithms for Dynamic Problems
Non-random mating seems to be the norm in nature among sexual organisms. A common mating criteria among animals is assortative mating, where individuals mate according to their phe...
Gabriela Ochoa, Christian Mädler-Kron, Ricard...