Sciweavers

8125 search results - page 378 / 1625
» Parallelism and evolutionary algorithms
Sort
View
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 9 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
117
Voted
ICPP
1996
IEEE
15 years 9 months ago
A Study of a Non-Linear Optimization Problem Using a Distributed Genetic Algorithm
Abstract
Nuno Neves, Anthony-Trung Nguyen, Edgar L. Torres
EDM
2010
138views Data Mining» more  EDM 2010»
15 years 6 months ago
Multiple Test Forms Construction based on Bees Algorithm
This paper proposes a new construction method of multiple test forms that applies a Bees Algorithm and a parallel computation technique to improve the computational costs of the tr...
Pokpong Songmuang, Maomi Ueno
ICPP
2006
IEEE
15 years 11 months ago
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
David A. Bader, Kamesh Madduri
116
Voted
PPSN
2000
Springer
15 years 8 months ago
Symbiotic Combination as an Alternative to Sexual Recombination in Genetic Algorithms
Recombination in the Genetic Algorithm (GA) is supposed to enable the component characteristics from two parents to be extracted and then reassembled in different combinations
Richard A. Watson, Jordan B. Pollack