Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Milos Seda"'
Autor:
Milos Seda
Publikováno v:
Symmetry, Vol 15, Iss 11, p 1979 (2023)
The maximum clique problem is a problem that takes many forms in optimization and related graph theory problems, and also has many applications. Because of its NP-completeness (nondeterministic polynomial time), the question arises of its solvability
Externí odkaz:
https://doaj.org/article/afee1a2b5ac44ceaadd387a44e100a84
Autor:
Dick Carrillo Melgarejo, Jiri Pokorny, Pavel Seda, Arun Narayanan, Pedro H. J. Nardelli, Mehdi Rasti, Jiri Hosek, Milos Seda, Demostenes Z. Rodriguez, Yevgeni Koucheryavy, Gustavo Fraidenraich
Publikováno v:
IEEE Access, Vol 10, Pp 53746-53760 (2022)
The application of flying base stations (FBS) in wireless communication is becoming a key enabler to improve cellular wireless connectivity. Following this tendency, this research work aims to enhance the spectral efficiency of FBSs using the radio a
Externí odkaz:
https://doaj.org/article/e4a5e1a63944446aab5feff1d30339c5
Autor:
Milos Seda
Publikováno v:
Algorithms, Vol 15, Iss 10, p 377 (2022)
The assignment problem is a problem that takes many forms in optimization and graph theory, and by changing some of the constraints or interpreting them differently and adding other constraints, it can be converted to routing, distribution, and sched
Externí odkaz:
https://doaj.org/article/b5baf1ced6a84abe9704e07cefe4a49c
Publikováno v:
IEEE Access, Vol 7, Pp 9395-9405 (2019)
In this paper, we focus on the problem of minimizing a network of state facilities that provide essential public services (schools, offices, and hospitals). The goal is to reduce the size of the network in order to minimize the costs associated with
Externí odkaz:
https://doaj.org/article/784a500ea0ac49938e2191cd4ae628f0
Publikováno v:
Sensors, Vol 21, Iss 16, p 5580 (2021)
The amount of internet traffic generated during mass public events is significantly growing in a way that requires methods to increase the overall performance of the wireless network service. Recently, legacy methods in form of mobile cell sites, fre
Externí odkaz:
https://doaj.org/article/fd09aea8208c44dc8de11959340092dd
Publikováno v:
Applied Sciences, Vol 10, Iss 24, p 8853 (2020)
The need to optimize the deployment and maintenance costs for service delivery in wireless networks is an essential task for each service provider. The goal of this paper was to optimize the number of service centres (gNodeB) to cover selected custom
Externí odkaz:
https://doaj.org/article/7a0623b129324bedbdbb5c6a01cd3012
Autor:
Milos Seda
Publikováno v:
WSEAS TRANSACTIONS ON COMPUTERS. 21:257-262
The Steiner tree problem in graphs involves finding a minimum cost tree which connects a defined subset of the vertices. This problem generalises the minimum spanning tree problem, in contrast, it is NP-complete and is usually solved for large instan
Publikováno v:
Machines, Vol 12, Iss 7, p 444 (2024)
This review paper is an homage to Arvid Palmgren’s pioneering paper on rolling bearing service life to highlight its relevance a century later. It follows the evolution of bearing service life theory from Palmgren’s fundamental research to the co
Externí odkaz:
https://doaj.org/article/c08ac385434e4f4b9a9b92dcaaafa8c5
Autor:
Miloš Sedak, Maja Rosić
Publikováno v:
Applied Sciences, Vol 13, Iss 21, p 11682 (2023)
The multi-objective optimization (MOO) of a planetary gearbox is a challenging optimization problem, which includes simultaneous minimization of a number of conflicting objectives including gearbox volume, contact ratio, power loss, etc., and at the
Externí odkaz:
https://doaj.org/article/e449d3cd916343a8865f5fbbe843f747
Publikováno v:
Applied Sciences, Vol 13, Iss 2, p 684 (2023)
This paper addresses the problem of time difference of arrival (TDOA) based passive target localizationand proposes an improved chaos-driven hybrid differential evolution (DE) algorithm and butterfly optimization algorithm (BOA), named ICDEBOA, to so
Externí odkaz:
https://doaj.org/article/a9c960f5d77a468281616e1d93fe569a