Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Novikov S.

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: combinations without repetitions

Sortuj według:

Ogranicz wyniki do:

Parallelization of computations for generating combinations

Novikov S.

Studia Informatica : systems and information technology

2017

Vol. 1-2(21)

47--62

An effective sequential algorithm and two parallel algorithms for generating combinations without repetitions of m out n of objects, represented by Boolean vectors, are proposed. One of them allows one to calculate starting and ending combinations for the subset, generated by each computing processor. The second algorithm firstly generates short (m-component) vectors on several computing processors. After that, by using special [n/m]-component vectors, it connects the short vectors into n-component Boolean vectors, each of which containing of exactly m units.

Parallelization of computations for finding the rank of a rectangular matrix

Novikov S.

Studia Informatica : systems and information technology

2013

Vol. 1-2(17)

49--62

The paper presents two parallel algorithms for finding the rank of a rectangular matrix and two parallel algorithms for generation of combinations without repetitions represented by Boolean vectors, that are used in an algorithm for finding the rank of a rectangular matrix .