Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Ahsan Sadee Tanim"'
Publikováno v:
Journal of Information Systems Engineering and Business Intelligence, Vol 5, Iss 1, Pp 32-39 (2019)
Background: Tour recommendation and path planning are the most challenging jobs for tourists as they decide Points of Interest (POI). Objective: To reduce the physical effort of the tourists and recommend them a personalized tour is the main objecti
Externí odkaz:
https://doaj.org/article/567745e094f144949ba4e796fe33f1cd
Autor:
Md. Sabir Hossain, Ahsan Sadee Tanim, Sadman Sakib Choudhury, S. M. Afif Ibne Hayat, Muhammad Nomani Kabir, Mohammad Mainul Islam
Publikováno v:
Emitter: International Journal of Engineering Technology, Vol 7, Iss 2 (2019)
The traveling salesman problem (TSP) is a famous NP-hard problem in the area of combinatorial optimization. It is utilized to locate the shortest possible route that visits every city precisely once and comes back to the beginning point from a given
Externí odkaz:
https://doaj.org/article/4e76ae5e76e145409d9eff995b246a5f
Autor:
Ahsan Sadee Tanim, S. M. Afif Ibne Hayat, Muhammad Nomani Kabir, Sadman Sakib Choudhury, Mohammad Mainul Islam, Md. Sabir Hossain
Publikováno v:
Emitter: International Journal of Engineering Technology, Vol 7, Iss 2 (2019)
The traveling salesman problem (TSP) is a famous NP-hard problem in the area of combinatorial optimization. It is utilized to locate the shortest possible route that visits every city precisely once and comes back to the beginning point from a given
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::566ba9f4a234497f811166be9046b42c
https://doi.org/10.24003/emitter.v7i2.380
https://doi.org/10.24003/emitter.v7i2.380
Autor:
Ratul Bhowmick, Ahsan Sadee Tanim, Muhammad Kamal Hossen, Md. Sabir Hossain, Ibrahim Sadek Bhuiyan
Publikováno v:
2019 1st International Conference on Advances in Science, Engineering and Robotics Technology (ICASERT).
The general algorithms which are followed to solve the Longest Common Subsequence (LCS) problems have both time complexity and space complexity of O(m * n). To reduce this complexity, two ways are proposed in this work. One is the use of Divide and C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6e6f78cf45fb18f8bcd11b72c451ff8
https://doi.org/10.1109/icasert.2019.8934638
https://doi.org/10.1109/icasert.2019.8934638