Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: shortest covering

Sortuj według:

Ogranicz wyniki do:

Parallel constructing of the shortest coverings of large Boolean matrices

Novikov S.

Studia Informatica : systems and information technology

2016

Vol. 1-2(20)

27--37

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.

Parallelization of computations for lossless data compression

Novikov S.

Studia Informatica : systems and information technology

2011

Vol. 1-2(15)

35--41

The paper presents two algorithms of parallelization of computations for lossless data compression. It is proposed as a parallel algorithm for Huffman coding and a parallel algorithm for coding of a set of numbers by the family of arithmetic progressions.

Investigations of the efficiency of a parallel program for construction of the shortest covering of a Boolean matrix

Adamus A., Novikov S.

Studia Informatica : systems and information technology

2010

Vol. 1-2(14)

67--76

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.