1628 search results - page 28 / 326 » Partitioning Sets with Genetic Algorithms |
IWPEC
2009
Springer
15 years 5 months ago
2009
Springer
In the p-Set Splitting problem we are given a universe U, a family F of subsets of U and a positive integer k and the objective is to find a partition of U into W and B such that...
71
Voted
GECCO
2005
Springer
15 years 4 months ago
2005
Springer
We propose a method for applying genetic algorithms to create 3D terrain data sets. Existing procedural algorithms for generation of terrain have several shortcomings. The most po...
105
click to vote
CBSE
2005
Springer
15 years 4 months ago
2005
Springer
This report presents data regarding simulation setup, the genetic algorithms setup and a short description to the use of the genetic algorithms. This report is written in the conte...
APPROX
2006
Springer
15 years 2 months ago
2006
Springer
In the minimum entropy set cover problem, one is given a collection of k sets which collectively cover an n-element ground set. A feasible solution of the problem is a partition o...
85
Voted
NETWORKS
2010
14 years 9 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...