Zobrazeno 1 - 10
of 125
pro vyhledávání: '"Janez Brest"'
Publikováno v:
IEEE Access, Vol 12, Pp 108921-108927 (2024)
Sequences with low auto-correlation sidelobes are important in diverse fields, including communications, radar, sonar, and medical imaging. The task of finding binary sequences with low auto-correlation is known as a difficult optimization problem. R
Externí odkaz:
https://doaj.org/article/43d097a5e276475381b1a8203cabc462
Autor:
Janez Brest, Borko Bošković, Dr.
Publikováno v:
Mendel, Vol 28, Iss 2 (2022)
In this paper, we present a computational search for best-known merit factors of longer binary sequences with an odd length. Finding low autocorrelation binary sequences with optimal or suboptimal merit factors is a very difficult optimization proble
Externí odkaz:
https://doaj.org/article/db57a0b9be6b48129117aee426889528
Publikováno v:
Mathematics, Vol 11, Iss 11, p 2484 (2023)
This paper proposes a hybrid machine translation (HMT) system that improves the quality of neural machine translation (NMT) by incorporating statistical machine translation (SMT). Therefore, two NMT systems and two SMT systems were built for the Slov
Externí odkaz:
https://doaj.org/article/5e8b830a9cc845c690ba2b1fe768f686
Publikováno v:
IEEE Access, Vol 9, Pp 51166-51178 (2021)
The authors got the motivation for writing the article based on an issue, with which developers of the newly developed nature-inspired algorithms are usually confronted today: How to select the test benchmark such that it highlights the quality of th
Externí odkaz:
https://doaj.org/article/f1ef1ac6d65c469695cf5dc3f317deb4
Autor:
Janez Brest, Borko Boskovic
Publikováno v:
IEEE Access, Vol 9, Pp 67713-67723 (2021)
Binary sequences are widely used in many practical fields, such as radar applications, telecommunications and cryptography. Finding low autocorrelation binary sequences with good peak side-lobe level (PSL) values is a difficult optimization problem.
Externí odkaz:
https://doaj.org/article/d55f2723a3a440948abd165094e684a8
Publikováno v:
Mendel, Vol 27, Iss 2 (2021)
In this paper we present an approach which given only a set of rules is able to learn to play the game of Checkers. We utilize neural networks and reinforced learning combined with Monte Carlo Tree Search and alpha-beta pruning. Any human influence o
Externí odkaz:
https://doaj.org/article/672aad335e4b4eeeb9e98ab5a8609bdb
Autor:
Janez Brest, Borko Boskovic
Publikováno v:
IEEE Access, Vol 6, Pp 4127-4134 (2018)
A low autocorrelation binary sequence (LABS) problem is a hard combinatorial problem and its solutions are important in many practical applications. Till now, the largest best-known skew-symmetric sequence with merit factor greater than 9 had a lengt
Externí odkaz:
https://doaj.org/article/aa697466342741a49b670fe069689a7b
Publikováno v:
IEEE Access, Vol 6, Pp 29516-29531 (2018)
The demand for solving large-scale complex problems continues to grow. Many real-world problems are described by a large number of variables that interact with each other in a complex way. The dimensionality of the problem has a direct impact on the
Externí odkaz:
https://doaj.org/article/1a5159a4468f435fa639337cbf17903b
Publikováno v:
The Scientific World Journal, Vol 2014 (2014)
Nature-inspired algorithms attract many researchers worldwide for solving the hardest optimization problems. One of the newest members of this extensive family is the bat algorithm. To date, many variants of this algorithm have emerged for solving co
Externí odkaz:
https://doaj.org/article/dfb5572928854b3c94560e58f5f0867d
Publikováno v:
The Scientific World Journal, Vol 2014 (2014)
The significant development of the Internet has posed some new challenges and many new programming tools have been developed to address such challenges. Today, semantic web is a modern paradigm for representing and accessing knowledge data on the Int
Externí odkaz:
https://doaj.org/article/81c58d963878468a8a2947ec1b067d43