2003 | OriginalPaper | Buchkapitel
Building-Block Identification by Simultaneity Matrix
verfasst von : Chatchawit Aporntewan, Prabhas Chongstitvatana
Erschienen in: Genetic and Evolutionary Computation — GECCO 2003
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We propose a BB identification by simultaneity matrix (BISM) algorithm. The input is a set of ℓ-bit solutions denoted by S. The number of solutions is denoted by n = |S|. The output is a partition of bit positions {0, ... , ℓ − 1}. The BISM is composed of Simultaneity-Matrix-Construction and Fine-Valid-Partition algorithms. Algorithm SMC is outlined as follows (a ij denotes the matrix element at row i and column j, Count S ab (i, j) = |{x ∈ {0, . . . , n − 1} : s x [i] = a and s x [j] = b{| for all (i, j) ∈ {0, ... , ℓ−1}2, (a, b) ∈ {0, 1}2, s x [i] denotes the ith bit of xth solution, Random(0,1) gives a real random number between 0 and 1).