1628 search results - page 121 / 326 » Partitioning Sets with Genetic Algorithms |
ICPR
2008
IEEE
15 years 5 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
GECCO
2009
Springer
15 years 5 months ago
2009
Springer
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
ICIP
2001
IEEE
16 years 27 days ago
2001
IEEE
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
148
click to vote
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE
This paper presents a new fault-tolerant scheduling algorithm for multiprocessor hard-real-time systems. The so called partitioning method is used to schedule a set of tasks in a ...
SIAMDM
2000
14 years 11 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...