PL
 |
EN
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników
Powiadomienia systemowe
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!
  • Sesja wygasła!

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available Parallelization of computations for generating combinations
Novikov S.
Studia Informatica : systems and information technology
|
2017
|
Vol. 1-2(21)
47--62
EN
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.
2
Content available 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
EN
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.
3
Content available 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
EN
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 .
4
Content available Parallelization of computations for lossless data compression
Novikov S.
Studia Informatica : systems and information technology
|
2011
|
Vol. 1-2(15)
35--41
EN
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.
5
Content available Finding the shortest path between vertices in a graph Hanoi
Novikov S.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2011
|
Vol. 16
123--128
EN
Three algorithms for finding the shortest path between two vertices with arbitrary labels of any fractal graph Hanoi S(k, n) and the exact estimation of the minimal distance between these vertices for the case k ≥ 3 and n ˂ k are proposed.
6
Content available 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
EN
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.
7
Content available Many-Valued Gates for Reducing the Chip-Area of Integrated Circuits
Novikov S.
Studia Informatica : systems and information technology
|
2007
|
Vol. 1(8)
7--17
EN
In this paper are proposed new many-valued gates K-PLA, T(2/K) and T(K/2) for a logical synthesis of digital integrated circuits. The semi-custom integrated circuit K-PLA has the architecture of a Programmable Logic Array of a type AND-OR and includes new K-valued valves MAX, MIN and GATE(A,j). A gate T(2/K) ( T(K/2)) is intended for transformation binary (K-valued ) entrance words into K-valued (binary) output words. The method of the logical synthesis with the use K-PLA, T(2/K) and T(K/2) allows to reduce nearly three times the chip-area, which is essential for placing of the circuit’s realization of the system of partial Boolean functions .
8
Content available remote Under and exact estimates of complexity of algorithms for multi-peg tower of Hanoi problem
Novikov S.
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
|
2007
|
Vol. 12
87-96
EN
It is proved under and exact estimates of complexity of algorithms for the multi-peg Tower of Hanoi problem with the limited number of discs.
9
Content available Method of Logical Synthesis of Integrated Circuits in basis K-PLA
Novikov S.
Studia Informatica : systems and information technology
|
2006
|
Vol. 1(7)
247--253
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.