Sciweavers

1628 search results - page 187 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
16 years 6 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
DATE
2002
IEEE
82views Hardware» more  DATE 2002»
15 years 11 months ago
Dynamic Scheduling and Clustering in Symbolic Image Computation
The core computation in BDD-based symbolic synthesis and verification is forming the image and pre-image of sets of states under the transition relation characterizing the sequen...
Gianpiero Cabodi, Paolo Camurati, Stefano Quer
ICALP
2009
Springer
16 years 6 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
PAKDD
2007
ACM
158views Data Mining» more  PAKDD 2007»
16 years 11 days ago
Density-Sensitive Evolutionary Clustering
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...
Maoguo Gong, Licheng Jiao, Ling Wang, Liefeng Bo
CEC
2005
IEEE
15 years 12 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...