Zobrazeno 1 - 4
of 4
pro vyhledávání: 'Mikloško, Jozef'
Autor:
Jozef Mikloško
Publikováno v:
BIT. 17:430-436
Let the calculation of thenth term of a general recurrence relation requireO(q(n)) arithmetical operations. The derivation is given of a new algorithm that performsm repetitions of this calculation with different initial conditions requiring onlyO(q(
Autor:
Vadim Kotov, Jozef Mikloško
Publikováno v:
Algorithms, Software and Hardware of Parallel Computers ISBN: 9783662111086
With the increasing complexity of problems to be solved and system structures, the difficulties of program construction has grown. In the first place, this holds for parallel programs which do not use the conventional step-by-step representation of c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3174fcb3140bd18d586917bf930e77d
https://doi.org/10.1007/978-3-662-11106-2_3
https://doi.org/10.1007/978-3-662-11106-2_3
Autor:
Jozef Mikloško, Vadim Evgenich Kotov
Publikováno v:
Algorithms, Software and Hardware of Parallel Computers ISBN: 9783662111086
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::00ae44259c4c3edcebc21f8f670d276b
https://doi.org/10.1007/978-3-662-11106-2_4
https://doi.org/10.1007/978-3-662-11106-2_4
Autor:
Jozef Mikloško, Vadim Evgenich Kotov
Publikováno v:
Algorithms, Software and Hardware of Parallel Computers ISBN: 9783662111086
In the past, the speed of computers was mainly increased by increasing the speed of their logic element. Thus, the memory cycle time has increased by two orders of magnitude. Improvements in technology achieved in the last 20 years have increased the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71b9c90c169950acfdc7bded4b4b3746
https://doi.org/10.1007/978-3-662-11106-2_12
https://doi.org/10.1007/978-3-662-11106-2_12