1628 search results - page 72 / 326 » Partitioning Sets with Genetic Algorithms |
ISAAC
2003
Springer
15 years 4 months ago
2003
Springer
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty sets V1, V2 such that for each vertex v, if v ∈ Vi th...
SG
2010
Springer
15 years 4 months ago
2010
Springer
This paper is an artist statement describing a manipulation of the Mandelbrot Set equation as the basis for creating semi-figurative images, using a genetic algorithm. Modernist pa...
COMBINATORICA
2008
14 years 9 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
108
click to vote
GECCO
2008
Springer
15 years 8 days ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
EURODAC
1995
IEEE
15 years 2 months ago
1995
IEEE
An important system design task is the partitioning of system functionality for implementation among multiple system components, including partitions among hardware and software c...