EUVIMEDEUVIMED entdecken
Crossref

DRL-Based Computing Resource Matching for Task Inference and Block Mining in Blockchain-Assisted Edge Intelligence

Zhibo Hao, Wenhao Fan, Chenhui Bao, Guan Wang, Lun Li, Penghui Chen, Bihua Tang, Yuan’an Liu

IEEE Transactions on Cloud Computing · 2026-04 · 14 (2) · 1229-1243

DOI: 10.1109/tcc.2026.3688901 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Cloud Computing, 2026-04. Verfasst von Zhibo Hao und 7 weiteren Autor:innen. Die Arbeit nennt 28 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Beijing Natural Science Foundation, Science and Technology Program of Qinghai Province of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Natural Science Foundation of China
  • Beijing Natural Science Foundation
  • Science and Technology Program of Qinghai Province of China
  • Fundamental Research Funds for the Central Universities

Zitieren

APA

Hao, Z., Fan, W., Bao, C., Wang, G., Li, L., Chen, P., Tang, B., & Liu, Y. (2026). DRL-Based Computing Resource Matching for Task Inference and Block Mining in Blockchain-Assisted Edge Intelligence. IEEE Transactions on Cloud Computing, 14(2), 1229-1243. https://doi.org/10.1109/tcc.2026.3688901

Vancouver

Hao Z, Fan W, Bao C, Wang G, Li L, Chen P, et al. DRL-Based Computing Resource Matching for Task Inference and Block Mining in Blockchain-Assisted Edge Intelligence. IEEE Transactions on Cloud Computing. 2026;14(2):1229-1243. doi:10.1109/tcc.2026.3688901

BibTeX
@article{Hao2026,
  author = {Hao, Zhibo and Fan, Wenhao and Bao, Chenhui and Wang, Guan and Li, Lun and Chen, Penghui and Tang, Bihua and Liu, Yuan’an},
  title = {DRL-Based Computing Resource Matching for Task Inference and Block Mining in Blockchain-Assisted Edge Intelligence},
  journal = {IEEE Transactions on Cloud Computing},
  year = {2026},
  volume = {14},
  number = {2},
  pages = {1229--1243},
  doi = {10.1109/tcc.2026.3688901}
}
Kostenlos starten →