Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Michal Mrena"'
Publikováno v:
SoftwareX, Vol 26, Iss , Pp 101715- (2024)
Discrete functions are an integral part of numerous areas of research in mathematics and computer science. Efficient processing of such functions in a computer requires an appropriate representation. A very effective representation is decision diagra
Externí odkaz:
https://doaj.org/article/f21d7dc2326344f980cdb6f830a02b1d
Publikováno v:
2022 IEEE 16th International Scientific Conference on Informatics (Informatics).
Autor:
Michal Mrena, Miroslav Kvassay
Publikováno v:
2022 IEEE 16th International Scientific Conference on Informatics (Informatics).
Autor:
Nika Kvassayova, Maria Bendikova, Jan Horvath, Miroslav Kvassay, Sergey Stankevich, Michal Mrena
Publikováno v:
2022 20th International Conference on Emerging eLearning Technologies and Applications (ICETA).
Publikováno v:
New Advances in Dependability of Networks and Systems ISBN: 9783031067457
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fbe99f517d27f559d8d802d73fafc438
https://doi.org/10.1007/978-3-031-06746-4_17
https://doi.org/10.1007/978-3-031-06746-4_17
Publikováno v:
2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS).
Autor:
Miroslav Kvassay, Michal Mrena
Publikováno v:
IDT
A Binary Decision Diagram (BDD) is a data structure that can be used for efficient representation of Boolean functions. It allows storing a Boolean function of many variables and manipulating with it. For a given Boolean function, a BDD can be create
Publikováno v:
2020 18th International Conference on Emerging eLearning Technologies and Applications (ICETA).
Reliability belongs to key characteristics of most technical, as well as, non-technical systems. Therefore, its evaluation should be one of the principal skills of graduates of technically oriented study programs, such as mechanical engineering, elec
Publikováno v:
2019 International Conference on Information and Digital Technologies (IDT).
A priority queue belongs to most useful abstract data types. It plays a key role in graph algorithms, such as Dijkstra’s or Prim’s algorithm, in data mining algorithms, such as OPTICS, in discrete-event simulation, or in CPU scheduling. Various i