Sciweavers

3117 search results - page 39 / 624
» The Spatially-Dispersed Genetic Algorithm
Sort
View
FOGA
2011
13 years 1 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
14 years 1 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
TSMC
2002
137views more  TSMC 2002»
13 years 9 months ago
An evolutionary tabu search for cell image segmentation
Many problems in practically all fields of science, engineering and technology involve global optimization. It becomes more and more important to develop the efficient global opti...
Tianzi Jiang, Faguo Yang
TEC
2010
132views more  TEC 2010»
13 years 4 months ago
A Hybrid Evolutionary Approach to the Nurse Rostering Problem
Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle t...
Ruibin Bai, Edmund K. Burke, Graham Kendall, Jingp...