Zobrazeno 1 - 10
of 573
pro vyhledávání: '"Kumar, T. K. A."'
Multi-Agent Path Finding (MAPF), which involves finding collision-free paths for multiple robots, is crucial in various applications. Lifelong MAPF, where targets are reassigned to agents as soon as they complete their initial targets, offers a more
Externí odkaz:
http://arxiv.org/abs/2403.13421
Neural Networks and related Deep Learning methods are currently at the leading edge of technologies used for classifying objects. However, they generally demand large amounts of time and data for model training; and their learned models can sometimes
Externí odkaz:
http://arxiv.org/abs/2204.05112
Autor:
Muruli, Muruli, Gireesh Kumar, T K
Publikováno v:
Muruli, Muruli and Gireesh Kumar, T K Open Educational Resources for Redefining the Learning Horizons: An Evaluation., 2021 . In International Conference on Digital Landscape Re-invention and Re-engineering of Libraries: Issues and Challenges (65th ILA Conference), Online, February 26-28, 2021. [Conference paper]
The paper explores the potential of Open Educational Resources (OER) in the current learning situation. It investigates the importance of Open Access Resources and Open Educational Movement in the changed society, which is network, oriented. The majo
Externí odkaz:
http://eprints.rclis.org/42343/
Autor:
Gireesh Kumar, T. K.
Publikováno v:
Gireesh Kumar, T. K. Role of Libraries in Enhancing the Research Visibility and Collaboration of Academics., 2020 . In 3rd National Virtual Conference on Reinventing Excellence in Librarianship, LIS Academy Virtual Conference 3rd LISACON-2020, University of Hyderabad, 27-30 August 2020. [Conference paper]
Promoting collaboration among the academics can improve the quality and visibility of research at global level. This paper discusses publication strategies that can help to achieve maximum research visibility and enhance the chances of collaboration
Externí odkaz:
http://eprints.rclis.org/42238/
Publikováno v:
Proceedings of the Twelfth International Symposium on Combinatorial Search (2020), 48-57
Embedding undirected graphs in a Euclidean space has many computational benefits. FastMap is an efficient embedding algorithm that facilitates a geometric interpretation of problems posed on undirected graphs. However, Euclidean distances are inheren
Externí odkaz:
http://arxiv.org/abs/2006.03112
Autor:
Li, Jiaoyang, Tinka, Andrew, Kiesel, Scott, Durham, Joseph W., Kumar, T. K. Satish, Koenig, Sven
Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where agents are constantly engaged with new goal locations, such as in large-
Externí odkaz:
http://arxiv.org/abs/2005.07371
Autor:
Bassman, Lindsay, Gulania, Sahil, Powers, Connor, Li, Rongpeng, Linker, Thomas, Liu, Kuang, Kumar, T. K. Satish, Kalia, Rajiv K., Nakano, Aiichiro, Vashishta, Priya
Publikováno v:
Quantum Sci. Technol. 6, 014007 (2020)
Simulation of the dynamics of quantum materials is emerging as a promising scientific application for noisy intermediate-scale quantum (NISQ) computers. Due to their high gate-error rates and short decoherence times, however, NISQ computers can only
Externí odkaz:
http://arxiv.org/abs/2004.07418
Autor:
Gireesh Kumar, T. K.
Publikováno v:
Gireesh Kumar, T. K. Distinguish Yourself from Someone: Role of Researcher Profiles in the Academic Environment., 2019 . In International Conference on Digital Technologies and Transformation in Academic Libraries [DigiTTAL-2019], National Institute of Technology Karnataka, Surathkal, Karnataka, India, December 26-28, 2019. [Conference paper]
This paper discusses the different types of researcher profile platforms used by the academic community, their advantages, and limitations. Awareness, usage, and application of researcher profiles for various utilities with reference to the faculties
Externí odkaz:
http://eprints.rclis.org/42363/
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
In this paper, we study the one-shot and lifelong versions of the Target Assignment and Path Finding problem in automated sortation centers, where each agent needs to constantly assign itself a sorting station, move to its assigned station without co
Externí odkaz:
http://arxiv.org/abs/1912.00253