1628 search results - page 116 / 326 » Partitioning Sets with Genetic Algorithms |
KDD
2005
ACM
15 years 4 months ago
2005
ACM
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
114
click to vote
EMSOFT
2004
Springer
15 years 4 months ago
2004
Springer
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
AAIM
2007
Springer
15 years 5 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
185
click to vote
ICDE
1998
IEEE
16 years 20 days ago
1998
IEEE
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
167
click to vote
VLDB
2008
ACM
15 years 11 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...