Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Anand Sunder"'
Autor:
Anand Sunder
One of the most challenging problems in computational geometry is closest pair of points given n points. Brute force algorithms[1] and Divide and conquer[1] have been verified and the lowest complexity of attributed to latter class of algorithms, wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2659::4c30558f69022855e6b93a3e99dca35e
https://zenodo.org/record/5820619
https://zenodo.org/record/5820619
Autor:
Anand Sunder
Publikováno v:
International Journal of Applied Industrial Engineering. 6:29-45
The article discusses a methodology to reduce cycle times through an algorithmic, analytical framework for sequential process flows. Studying process flow flexibility for reducing bottlenecks has always continued to open new research avenues. This me
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc222e015f7e4d09df03dd732e2074fc
https://doi.org/10.4018/ijaie.2019010102
https://doi.org/10.4018/ijaie.2019010102
Autor:
Anand Sunder
Publikováno v:
Global Journal of Computer Science and Technology. :23-24
Site Reliability Engineering has opened a pandora’s box of new technological challenges [1],[3],[6],[10]. Trying to condense all of it into one structure or system is one such requirement. We show the interaction between people, processes, and tech
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7f52cd5e68185b48644d90384945c19
https://doi.org/10.34257/gjcstgvol21is1pg23
https://doi.org/10.34257/gjcstgvol21is1pg23
Autor:
Abhishake Kundu, Anand Sunder
Publikováno v:
American Journal of Computer Science and Technology. 4:119
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9b60351cb87d9a3c84165b471971e45e
https://doi.org/10.11648/j.ajcst.20210404.15
https://doi.org/10.11648/j.ajcst.20210404.15