Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Marie Hubalovska"'
Autor:
Marie Hubalovska, Stepan Major
Publikováno v:
Biomimetics, Vol 8, Iss 6, p 508 (2023)
In this paper, a new human-based metaheuristic algorithm called Technical and Vocational Education and Training-Based Optimizer (TVETBO) is introduced to solve optimization problems. The fundamental inspiration for TVETBO is taken from the process of
Externí odkaz:
https://doaj.org/article/acdeb08783f74981b13675d0db7eb8f1
Autor:
Hadi Givi, Marie Hubalovska
Publikováno v:
Computers, Materials & Continua. 74:179-202
Publikováno v:
ICERI2022 Proceedings.
Publikováno v:
Mathematics, Vol 9, Iss 2832, p 2832 (2021)
Mathematics
Volume 9
Issue 21
Mathematics
Volume 9
Issue 21
Numerous optimization problems have been defined in different disciplines of science that must be optimized using effective techniques. Optimization algorithms are an effective and widely used method of solving optimization problems that are able to
Publikováno v:
EDULEARN Proceedings.
Publikováno v:
EDULEARN Proceedings.
Publikováno v:
Computers in Human Behavior. 92:691-705
The paper deals with assessment of the influence of adaptive e-learning as a part of learning analytics on learning effectiveness of primary school pupils. E-learning exercises containing implemented adaptive elements were created in accordance with
Publikováno v:
Mathematics, Vol 9, Iss 919, p 919 (2021)
Mathematics
Volume 9
Issue 9
Mathematics
Volume 9
Issue 9
Discrete mathematics covers the field of graph theory, which solves various problems in graphs using algorithms, such as coloring graphs. Part of graph theory is focused on algorithms that solve the passage through mazes and labyrinths. This paper pr
Publikováno v:
Mathematics
Volume 8
Issue 12
Mathematics, Vol 8, Iss 2152, p 2152 (2020)
Volume 8
Issue 12
Mathematics, Vol 8, Iss 2152, p 2152 (2020)
Let (Fn)n&ge
0 be the Fibonacci sequence given by Fn+2=Fn+1+Fn, for n&ge
0, where F0=0 and F1=1. There are several interesting identities involving this sequence such as Fn2+Fn+12=F2n+1, for all n&ge
0. In 2012, Chaves, Marques and Tog
0 be the Fibonacci sequence given by Fn+2=Fn+1+Fn, for n&ge
0, where F0=0 and F1=1. There are several interesting identities involving this sequence such as Fn2+Fn+12=F2n+1, for all n&ge
0. In 2012, Chaves, Marques and Tog
Autor:
Stepan Major, Marie Hubalovska
Publikováno v:
ICERI Proceedings.