- 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ł