1628 search results - page 86 / 326 » Partitioning Sets with Genetic Algorithms |
ICDM
2003
IEEE
15 years 4 months ago
2003
IEEE
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
SIAMCOMP
2002
14 years 11 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
116
click to vote
FOCS
2000
IEEE
15 years 3 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
ESANN
2008
15 years 20 days ago
2008
We present an algorithm which partitions a data set in two parts with equal size and experimentally nearly the same distribution measured through the likelihood of a Parzen kernel ...
ATAL
2004
Springer
15 years 4 months ago
2004
Springer
This paper explores hybrid agents that use a variety of techniques to improve their performance in an environment over time. We considered, specifically, geneticlearning-parentin...