Author of the publication

Blockchain-Based Distributed Multiagent Reinforcement Learning for Collaborative Multiobject Tracking Framework.

, , , , , and . IEEE Trans. Computers, 73 (3): 778-788 (March 2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Online Measurement-Based Estimation of Dynamic System State Matrix in Ambient Conditions., and . IEEE Trans. Smart Grid, 11 (1): 95-105 (2020)Improving Hessian Matrix Detector for SURF., , , , and . IEICE Trans. Inf. Syst., 94-D (4): 921-925 (2011)Theoretical modeling for performance analysis of IEEE 1901 power-line communication networks in the multi-hop environment., and . J. Supercomput., 76 (4): 2715-2747 (2020)Mining Hard Samples Globally and Efficiently for Person Reidentification., , , , , , and . IEEE Internet Things J., 7 (10): 9611-9622 (2020)Near-Online Tracking With Co-Occurrence Constraints in Blockchain-Based Edge Computing., , , , , , and . IEEE Internet Things J., 8 (4): 2193-2207 (2021)Theoretical modeling and analysis of Uplink performance for Three-dimension spatial RISs-aided Wireless communication systems., , , and . Comput. Commun., (October 2023)An Energy Harvesting Modified MAC Protocol for Power-Line Communication Systems Using RF Energy Transfer: Design and Analysis., and . IEICE Trans. Commun., 103-B (10): 1086-1100 (2020)Core-GAE: Toward Generation of IoT Networks., , , , and . IEEE Internet Things J., 9 (12): 9241-9248 (2022)An Occlusion and Noise-Aware Stereo Framework Based on Light Field Imaging for Robust Disparity Estimation., , , , , , and . IEEE Trans. Computers, 73 (3): 764-777 (March 2024)Heterogeneous Association Graph Fusion for Target Association in Multiple Object Tracking., , , , and . IEEE Trans. Circuits Syst. Video Technol., 29 (11): 3269-3280 (2019)