1628 search results - page 238 / 326 » Partitioning Sets with Genetic Algorithms |
SIGMOD
2010
ACM
14 years 2 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
ML
2007
ACM
13 years 9 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
PPOPP
2012
ACM
12 years 5 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
GECCO
2004
Springer
14 years 3 months ago
2004
Springer
A critical success factor in Insurance business is its ability to use information sources and contained knowledge in the most effective way. Its profitability is obtained through t...
HAIS
2009
Springer
14 years 2 months ago
2009
Springer
Developing models and methods to manage data vagueness is a current effervescent research field. Some work has been done with supervised problems but unsupervised problems and unce...