Displaying similar documents to “A note on direct methods for approximations of sparse Hessian matrices”

A factor graph based genetic algorithm

B. Hoda Helmi, Adel T. Rahmani, Martin Pelikan (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable...

Graph Radiocoloring Concepts

R. Kalfakakou, G. Nikolakopoulou, E. Savvidou, M. Tsouros (2003)

The Yugoslav Journal of Operations Research

Similarity:

Packing of (0, 1)-matrices

Stéphane Vialette (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

The MATRIX PACKING DOWN problem asks to find a row permutation of a given -matrix in such a way that the total sum of the first non-zero column indexes is maximized. We study the computational complexity of this problem. We prove that the MATRIX PACKING DOWN problem is -complete even when restricted to zero trace symmetric -matrices or to -matrices with at most two 's per column. Also, as intermediate results, we introduce several new simple graph layout problems which are proved...