Representation and recombination over nonsingular binary matrices

Authors:
Yong-Hyuk Kim;Yourim Yoon
Affiliations:
Kwangwoon University, Seoul, South Korea;Seoul National University, Seoul, South Korea
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 7
Cited 1

Toward More Powerful Recombinations

Proceedings of the 6th International Conference on Genetic Algorithms
Genetic Search For Fixed Channel Assignment Problem With Limited Bandwidth

GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
Analyzing Directed Acyclic Graph Recombination

Proceedings of the International Conference, 7th Fuzzy Days on Computational Intelligence, Theory and Applications
New topologies for genetic search space

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Linear transformation in Pseudo-Boolean functions

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Two congruence classes for symmetric binary matrices over F2

WSEAS Transactions on Mathematics
Geometric crossover for biological sequences

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming

A spanning tree-based encoding of the MAX CUT problem for evolutionary search

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study nonsingular binary matrix space, GLn(Z2). The space is important in that it is used for the change of basis in binary encoding, which is the representation typically used in genetic algorithms. We analyze the properties of GLn(Z2) and discuss possible representation and recombination operators when used in volutionary algorithms. Not only typical approaches but also ones using elementary matrices of linear algebra are presented.