Autor der Publikation

A Modular Simulator Framework for Network-on-Chip Based Manycore Chips Using UNISIM.

, , und . Trans. High Perform. Embed. Archit. Compil., (2011)

Bitte wählen Sie eine Person um die Publikation zuzuordnen

Um zwischen Personen mit demselben Namen zu unterscheiden, wird der akademische Grad und der Titel einer wichtigen Publikation angezeigt. Zudem lassen sich über den Button neben dem Namen einige der Person bereits zugeordnete Publikationen anzeigen.

 

Other publications of authors with the same name

Knapsack Model and Algorithm for HW/SW Partitioning Problem., , and . International Conference on Computational Science, volume 3036 of Lecture Notes in Computer Science, page 200-205. Springer, (2004)Energy-Efficient Offloading in Mobile Edge Computing with Edge-Cloud Collaboration., , and . ICA3PP (3), volume 11336 of Lecture Notes in Computer Science, page 460-475. Springer, (2018)Finding High Performance Solution in Reconfigurable Mesh-Connected VLSI Arrays., and . Asia-Pacific Computer Systems Architecture Conference, volume 3189 of Lecture Notes in Computer Science, page 440-448. Springer, (2004)ETRA: Efficient Three-Stage Resource Allocation Auction for Mobile Blockchain in Edge Computing., , , , and . ICPADS, page 701-705. IEEE, (2018)Algorithms for bi-objective multiple-choice hardware/software partitioning., , , and . Comput. Electr. Eng., (2016)Efficient hybrid multicast approach in wireless data center network., , , , and . Future Gener. Comput. Syst., (2018)Flexible robust principal component analysis., , and . Int. J. Machine Learning & Cybernetics, 11 (3): 603-613 (2020)An efficient algorithm for the collapsing knapsack problem., and . Inf. Sci., 176 (12): 1739-1751 (2006)Fog Computing Model and Efficient Algorithms for Directional Vehicle Mobility in Vehicular Network., , , , and . IEEE Trans. Intell. Transp. Syst., 22 (5): 2599-2614 (2021)Integrating Two Logics Into One Crossbar Array for Logic Gate Design., , , , , and . IEEE Trans. Circuits Syst. II Express Briefs, 68 (8): 2987-2991 (2021)