1628 search results - page 22 / 326 » Partitioning Sets with Genetic Algorithms |
FCT
2005
Springer
15 years 4 months ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
104
click to vote
HEURISTICS
2002
14 years 10 months ago
2002
In the paper, a new hybrid genetic algorithm solving the DNA sequencing problem with negative and positive errors is presented. The algorithm has as its input a set of oligonucleo...
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
This paper presents a system that uses Genetic Algorithm (GA) to evolve hierarchical pulse sets (i.e., hierarchical duration vs. amplitude matrices) for expressive music performan...
FPL
2006
Springer
15 years 2 months ago
2006
Springer
This paper presents an automated partitioning strategy to divide a design into a set of partitions based on design hierarchy information. While the primary objective is to use the...