1628 search results - page 206 / 326 » Partitioning Sets with Genetic Algorithms |
147
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
132
Voted
ICAS
2006
IEEE
15 years 9 months ago
2006
IEEE
— We target the problem of predicting resource usage in situations where the modeling data is scarce, non-stationary, or expensive to obtain. This scenario occurs frequently in c...
137
Voted
AIEDAM
2000
15 years 3 months ago
2000
In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effect...
151
Voted
CORR
2010
Springer
15 years 25 days ago
2010
Springer
In the paper, an evolutionary approach to test generation for functional BIST is considered. The aim of the proposed scheme is to minimize the test data volume by allowing the dev...
126
click to vote
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract-- In evolutionary algorithms, the fitness of a population increases with time by mutating and recombining individuals and by a biased selection of more fit individuals. Th...