Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Urszula Boryczka"'
Autor:
Krzysztof Szwarc, Urszula Boryczka
Publikováno v:
PLoS ONE, Vol 17, Iss 2, p e0264584 (2022)
This article presents a new approach to designing a Harmony Search (HS) algorithm, adapted to solve Orienteering Problem (OP) instances. OP is a significant [Formula: see text]-hard problem that has considerable practical application, requiring the d
Externí odkaz:
https://doaj.org/article/336cf3cbe4e6445fa6f4382dfba997be
Autor:
Michał Bałchanowski, Urszula Boryczka
Publikováno v:
Entropy, Vol 25, Iss 1, p 132 (2023)
The aim of a recommender system is to suggest to the user certain products or services that most likely will interest them. Within the context of personalized recommender systems, a number of algorithms have been suggested to generate a ranking of it
Externí odkaz:
https://doaj.org/article/accd223c9c794564b60ef222aa9e3d45
Autor:
Urszula Boryczka, Krzysztof Szwarc
Publikováno v:
Journal of Information and Telecommunication, Vol 3, Iss 1, Pp 2-18 (2019)
The paper is an extended version of the conference article, which presents a modification of the Harmony Search algorithm, adapted to the effective resolution of the asymmetric case of the Traveling Salesman Problem. The efficacy of the proposed appr
Externí odkaz:
https://doaj.org/article/22b5af8517bc4102bd003c9ed93aa6f0
Autor:
Kamil Dworak, Urszula Boryczka
Publikováno v:
Entropy, Vol 23, Iss 12, p 1697 (2021)
This article presents the author’s own metaheuristic cryptanalytic attack based on the use of differential cryptanalysis (DC) methods and memetic algorithms (MA) that improve the local search process through simulated annealing (SA). The suggested
Externí odkaz:
https://doaj.org/article/4e398172045047d6ba28acd15b5dc53a
Autor:
Krzysztof Szwarc, Urszula Boryczka
Publikováno v:
Applied Sciences, Vol 10, Iss 18, p 6422 (2020)
This paper presents a modification of the Harmony Search algorithm (HS) adjusted to an effective solving of instances of the Asymmetric Traveling Salesman Problem. The improvement of the technique spans the application of a pheromone, which, by servi
Externí odkaz:
https://doaj.org/article/d6a19d854d894a479ec99f8ac811d310
Publikováno v:
Entropy, Vol 21, Iss 8, p 738 (2019)
This paper presents a discrete particle swarm optimization (DPSO) algorithm with heterogeneous (non-uniform) parameter values for solving the dynamic traveling salesman problem (DTSP). The DTSP can be modeled as a sequence of static sub-problems, eac
Externí odkaz:
https://doaj.org/article/433dcce6b8ed4d1b87a084b141de9f6c
Autor:
Michał Bałchanowski, Urszula Boryczka
Publikováno v:
Procedia Computer Science. 207:2213-2222
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39b3ec728bd2e79fec56fbe4d2af3778
https://doi.org/10.1016/j.procs.2022.09.281
https://doi.org/10.1016/j.procs.2022.09.281
Publikováno v:
Procedia Computer Science. 207:1174-1182
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::babe195051c104d675491473b5b8969a
https://doi.org/10.1016/j.procs.2022.09.173
https://doi.org/10.1016/j.procs.2022.09.173
Autor:
Tomasz Płoska, Urszula Boryczka
Publikováno v:
No Limits. :16-19
Klucze dzikich ptaków czy ławice ryb w harmonijny i skoordynowany sposób podążają w danym kierunku w symetrycznym układzie. Gdy nagle zmieniają kierunek nie wpadają na siebie i nie łamią szyku. To prawdziwy przyrodniczy fenomen. I to wła
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::234d6787ccada589d5398fdb9943f026
https://doi.org/10.31261/no_limits.2021.3.06
https://doi.org/10.31261/no_limits.2021.3.06
Autor:
Michał Bałchanowski, Urszula Boryczka
Publikováno v:
KES
of the generated recommendations, different techniques are often used which try to personalize recommendations. Usually user preferences are stored in the form of a vector in which individual values describe to what extent a given feature is desired
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a42ff961574a51bdf2059e94eda6e9b4
https://doi.org/10.1016/j.procs.2021.08.236
https://doi.org/10.1016/j.procs.2021.08.236