Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Aderemi E. Okeyinka"'
Publikováno v:
2023 International Conference on Science, Engineering and Business for Sustainable Development Goals (SEB-SDG).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44f0d07b020afa2fa6de6b7144e9f2b2
https://doi.org/10.1109/seb-sdg57117.2023.10124469
https://doi.org/10.1109/seb-sdg57117.2023.10124469
Autor:
Emmanuel O. Asani, Oladapo Daniel Akande, Esther Edeghogho Okosun, Oluwambo Tolulope Olowe, Roseline Oluwaseun Ogundokun, Aderemi E. Okeyinka
Publikováno v:
2023 International Conference on Science, Engineering and Business for Sustainable Development Goals (SEB-SDG).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7972839795036a67d1ae94eb15436462
https://doi.org/10.1109/seb-sdg57117.2023.10124541
https://doi.org/10.1109/seb-sdg57117.2023.10124541
Publikováno v:
Proceedings of Sixth International Congress on Information and Communication Technology ISBN: 9789811621017
Proceedings of Sixth International Congress on Information and Communication Technology
Proceedings of Sixth International Congress on Information and Communication Technology
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a70c9e6605bc4aa10deee910ceb0d20
https://doi.org/10.1007/978-981-16-2102-4_60
https://doi.org/10.1007/978-981-16-2102-4_60
Publikováno v:
2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS).
The branch - and - bound strategy has been used successfully in solving certain categories of combinatorial optimization problems. It has also been viewed as a tool for solving Travelling Salesman Problem (TSP) of moderate size. In this paper a TSP o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b0c1af6cdb9e91b2d357ac8ae563d3a
https://doi.org/10.1109/icmcecs47690.2020.240901
https://doi.org/10.1109/icmcecs47690.2020.240901
Publikováno v:
2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS).
This study presents a construction tour technique (CH-NN) for solving the Travelling Salesman Problem based on the Convex-hull and Nearest Neighbor heuristics. The aim is to combine the advantages of both algorithms as well as minimize their substant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66eb69a7bd737ec4f398e11446ea25b7
https://doi.org/10.1109/icmcecs47690.2020.240847
https://doi.org/10.1109/icmcecs47690.2020.240847
Publikováno v:
2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS).
The minimal spanning tree is a structure used in solving certain types of combinatorial optimization problems. Popular application areas include network design such as roads, telephone, electrical and cable-laying. There are two popular algorithms fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::366ede23776d931f4b226b7a73fb47f9
https://doi.org/10.1109/icmcecs47690.2020.240900
https://doi.org/10.1109/icmcecs47690.2020.240900
Publikováno v:
2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS).
Modelling and forecasting of time series data are essential components of data science and big data analytics. Over the years, the Box-Jenkins Methodology has gained tremendous popularity and use for modelling univariate time series. However, the plo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c4a05fddd4806dcddc6501a8cb143b8
https://doi.org/10.1109/icmcecs47690.2020.246979
https://doi.org/10.1109/icmcecs47690.2020.246979