Zobrazeno 1 - 10
of 66
pro vyhledávání: '"Leszek Koszalka"'
Publikováno v:
Vietnam Journal of Computer Science, Vol 6, Iss 3, Pp 273-284 (2019)
This paper concentrates on the newly improved algorithm for solving the single-machine total weighted tardiness (SMTWT) problem, called Algorithm Inspired by Tree and Sorting (AIT-S). The algorithm is based on searching the solution space along with
Externí odkaz:
https://doaj.org/article/704c2f7ec29d45f2a1a8f693f08b93c3
Publikováno v:
Vietnam Journal of Computer Science, Vol 6, Iss 3, Pp 273-284 (2019)
This paper concentrates on the newly improved algorithm for solving the single-machine total weighted tardiness (SMTWT) problem, called Algorithm Inspired by Tree and Sorting (AIT-S). The algorithm is based on searching the solution space along with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0232a7284ecde2c16738060e059cc5da
https://doi.org/10.1142/s2196888819500106
https://doi.org/10.1142/s2196888819500106
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 32:1561-1573
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17f1149b14825081daaee0b32c39cc23
https://doi.org/10.3233/jifs-169150
https://doi.org/10.3233/jifs-169150
Publikováno v:
Computational Collective Intelligence ISBN: 9783030283766
ICCCI (1)
ICCCI (1)
The objective of this paper is an attempt to take part in the fast development of computer science, especially machine learning, in the field of finding the tools for supporting the disabled people. Speech-and–hearing impaired people are the part o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae5efe2d3c27956da67ee4d179680db7
https://doi.org/10.1007/978-3-030-28377-3_56
https://doi.org/10.1007/978-3-030-28377-3_56
Publikováno v:
Computational Collective Intelligence ISBN: 9783030283766
ICCCI (1)
ICCCI (1)
The objective of this work is to present the implemented algorithms to solving path planning in 3D printing problem. The algorithms have been compared on the basis of the obtained results of simulation experiments. As the indices of algorithm’s per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::96620d29493d0f79365125521bcd5b7a
https://doi.org/10.1007/978-3-030-28377-3_41
https://doi.org/10.1007/978-3-030-28377-3_41
Publikováno v:
2018 26th International Conference on Systems Engineering (ICSEng).
The considered problem of finding drilling machine route is a modified version of TSP. The modification consists in necessity of cyclic drill change which requires returning to starting point after performing a certain number of bores - depending on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59519f042ff6083384f00a834a152576
https://doi.org/10.1109/icseng.2018.8638201
https://doi.org/10.1109/icseng.2018.8638201
Publikováno v:
ISCBI
The paper presents various approaches to finding the optimal solution for a problem, which is an extension of the classical travelling salesmen problem (TSP). The problem consists in choosing the route between two distinct towns: starting and target,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02bd737d5a7ecdee4ff029df0e312af4
https://doi.org/10.1109/iscbi.2018.00012
https://doi.org/10.1109/iscbi.2018.00012
Publikováno v:
Computational Collective Intelligence ISBN: 9783319984452
ICCCI (2)
ICCCI (2)
This paper concentrates on the created algorithm for solving the single machine total weighted tardiness problem (SMTWT). The algorithm is based on searching the solution space along with the tree rules. The properties of the algorithm are studied ta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6610461edd58931271ab70bb9ebc20a8
https://doi.org/10.1007/978-3-319-98446-9_4
https://doi.org/10.1007/978-3-319-98446-9_4
Autor:
Martyna Poslednik, Andrzej Kasprzak, Iwona Pozniak-Koszalka, Jakub Klikowski, Lukasz Karnicki, Leszek Koszalka
Publikováno v:
Computational Collective Intelligence ISBN: 9783319984452
ICCCI (2)
ICCCI (2)
This paper concentrates on the algorithm based on simulated annealing approach. The algorithm was implemented for solving the formulated chess problem. The properties of the algorithm were analyzed taking into account the results of experiments made
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1ef178b1faca55bb5b2e1b379f512b34
https://doi.org/10.1007/978-3-319-98446-9_3
https://doi.org/10.1007/978-3-319-98446-9_3
Publikováno v:
ICSEng
In the paper, the problem of efficient task allocation in torus mesh network is considered. The authors tested the implemented metaheuristic algorithm which is based on Differential Evaluation method. The focus is taken on tuning the algorithm, i.e.,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5258b2939c6be3a4b14e1ff6b497fbaf
https://doi.org/10.1109/icseng.2017.54
https://doi.org/10.1109/icseng.2017.54