Parallel constructing of the shortest coverings of large Boolean matrices

DSpace/Manakin Repository

Show full item record

Title Parallel constructing of the shortest coverings of large Boolean matrices
Autor: Novikov, Sergey
URI: http://hdl.handle.net/11331/3445
Date: 2016
Źródło: Studia Informatica : systemy i technologie informacyjne. Nr 20 (2016), s. 27-37
Abstract: The paper presents two options of the parallel algorithm for finding the shortest covering of a large Boolean matrix, where the decomposition of the initial matrix into matrices of smaller sizes is based on the partitioning of rows. The parallel algorithm COVMB contains sequential algorithms for partitioning of initial m × n Boolean matrix on submatrices, building special matrices, summering of the shortest coverings of special Boolean matrices with smaller sizes as well as the sequential algorithm SECNOP for finding the shortest coverings of smaller Boolean matrices.

Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Uznanie autorstwa-Na tych samych warunkach 3.0 Polska Except where otherwise noted, this item's license is described as Uznanie autorstwa-Na tych samych warunkach 3.0 Polska

Search DSpace


Advanced Search

Browse

My Account

Statistics