Sciweavers

1129 search results - page 95 / 226
» Parallel Adaptive Genetic Algorithm
Sort
View
GECCO
2008
Springer
111views Optimization» more  GECCO 2008»
13 years 9 months ago
Multi-task code reuse in genetic programming
We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic progra...
Wojciech Jaskowski, Krzysztof Krawiec, Bartosz Wie...
EWC
2006
61views more  EWC 2006»
13 years 7 months ago
Embarrassingly parallel mesh refinement by edge subdivision
We have previously proposed a new technique for the communication-free adaptive refinement of tetrahedral meshes that works for all configurations. Implementations of the scheme mu...
David C. Thompson, Philippe P. Pébay
COR
2006
96views more  COR 2006»
13 years 7 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan
MVA
1992
127views Computer Vision» more  MVA 1992»
13 years 9 months ago
A Parallel Topological Map for Image Segmentation
We present a new algorithm for topological feature mapping. It is compared to other known feature mapping algorithmslike that proposed by Kohonen or Bertsch. The main difference t...
Dinu Scheppelmann, Jochen Frey, Manuela Schäf...
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
13 years 11 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...