Buscar
Mostrando ítems 11-12 de 12
Ponencia
Generating partial Hadamard matrices as solutions to a Constraint Satisfaction Problem characterizing cliques
(2017-07)
A procedure is described looking for partial Hadamard matrices, as cliques of a particular subgraph Gt of Ito’s Hadamard Graph Δ(4t) [9]. The key idea is translating the problem of extending a given clique Cm to a larger ...
Ponencia
ACS Searching for D4t-Hadamard Matrices
(Springer, 2010)
An Ant Colony System (ACS) looking for cocyclic Hadamard matrices over dihedral groups D4t is described. The underlying weighted graph consists of the rooted trees described in [1], whose vertices are certain subsets ...