895 search results - page 109 / 179 » An Indirect Genetic Algorithm for Set Covering Problems |
GECCO
2008
Springer
15 years 1 days ago
2008
Springer
This paper investigates how the Univariate Marginal Distribution Algorithm (UMDA) behaves in non-stationary environments when engaging in sampling and selection strategies designe...
TEC
2002
14 years 10 months ago
2002
We investigate the application of genetic algorithms (GAs) for recognizing real two-dimensional (2-D) or three-dimensional (3-D) objects from 2-D intensity images, assuming that th...
GECCO
2009
Springer
15 years 3 months ago
2009
Springer
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
COCOA
2008
Springer
15 years 23 days ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. This paper describes the application of four evolutionary algorithms to the pruning of neural networks used in classification problems. Besides of a simple genetic algor...