Abstract
An Ant Colony System (ACS) looking for cocyclic Hadamard matrices over dihedral groups D 4t is described. The underlying weighted graph consists of the rooted trees described in [1], whose vertices are certain subsets of coboundaries. A branch of these trees defines a D 4t -Hadamard matrix if and only if two conditions hold: (i) I i =i-1 and, (ii) c i =t, for every 2≤i≤t, where I i and c i denote the number of i-paths and i-intersections (see [3] for details) related to the coboundaries defining the branch. The pheromone and heuristic values of our ACS are defined in such a way that condition (i) is always satisfied, and condition (ii) is closely to be satisfied. © 2010 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Álvarez, V., Armario, J. A., Frau, M. D., Gudiel, F., Güemes, B., Martín, E., & Osuna, A. (2010). ACS searching for D 4t -hadamard matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6234 LNCS, pp. 368–375). https://doi.org/10.1007/978-3-642-15461-4_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
