Temat: shortest covering - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Investigations of the efficiency of a parallel program for construction of the shortest covering of a Boolean matrix
Autorzy:: Adamus, A.
Novikov, S.
Powiązania:: https://bibliotekanauki.pl/articles/93008.pdf
Data publikacji:: 2010
Wydawca:: Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:: Boolean matrix
shortest covering
parallel program
cluster
Opis:: The paper presents results of investigations of the efficiency of a parallel program for the solution of the NP-complete problem of constructing of the shortest covering of a Boolean matrix. It was explored dependencies of the time of constructing of the shortest covering from the number processing processors of a cluster and from the dimension of a Boolean matrix.
Źródło:: Studia Informatica : systems and information technology; 2010, 1-2(14); 67-76
1731-2264
Pojawia się w:: Studia Informatica : systems and information technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Parallel constructing of the shortest coverings of large Boolean matrices
Autorzy:: Novikov, S.
Powiązania:: https://bibliotekanauki.pl/articles/92853.pdf
Data publikacji:: 2016
Wydawca:: Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:: Boolean matrix
shortest covering
decomposition
sequential algorithm
parallel algorithm
cluster
Opis:: 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.
Źródło:: Studia Informatica : systems and information technology; 2016, 1-2(20); 27-37
1731-2264
Pojawia się w:: Studia Informatica : systems and information technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja