Opened Access ACS Searching for D4t-Hadamard Matrices
Citas

Estadísticas
Icon
Exportar a
Autor: Álvarez Solano, Víctor
Armario Sampalo, José Andrés
Frau García, María Dolores
Gudiel Rodríguez, Félix
Güemes Alzaga, María Belén
Martín García, Elena
Osuna Lucena, Amparo
Departamento: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de álgebra
Fecha: 2010
Publicado en: ANTS 2010 : 7th International Conference on Swarm Intelligence (2010), p 368-375
ISBN/ISSN: 978-3-642-15460-7
0302-9743
Tipo de documento: Ponencia
Resumen: 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 of coboundaries. A branch of these trees defines a D4t- Hadamard matrix if and only if two conditions hold: (i) Ii = i − 1 and, (ii) ci = t, for every 2 ≤ i ≤ t, where Ii and ci denote the number of ipaths 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.
Cita: Álvarez Solano, V., Armario Sampalo, J.A., Frau García, M.D., Gudiel Rodríguez, F., Güemes Alzaga, M.B., Martín García, E. y Osuna Lucena, A. (2010). ACS Searching for D4t-Hadamard Matrices. En ANTS 2010 : 7th International Conference on Swarm Intelligence (368-375), Brussels, Belgium: Springer.
Tamaño: 199.8Kb
Formato: PDF

URI: https://hdl.handle.net/11441/87397

DOI: 10.1007/978-3-642-15461-4_33

Ver versión del editor

Salvo que se indique lo contrario, los contenidos de esta obra estan sujetos a la licencia de Creative Commons: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones