Jingjin Wu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jing Fu 0001

> Home > Persons > Jingjin Wu

Publications

2023
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/cloudcom/XuFWZ23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cloudcom/XuFWZ23
Jiahe Xu, Jing Fu, Jingjin Wu, Moshe Zukerman:
Energy-Efficient Offloading in Edge Slicing with Non-Linear Power Functions. CloudCom 2023: 147-154
[i6]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2306-15185
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2306-15185
Ling Hou, Jingjin Wu, Jing Fu:
Asymptotically Optimal Energy Efficient Offloading Policies in Multi-Access Edge Computing Systems with Task Handover. CoRR abs/2306.15185 (2023)
2021
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/ica3pp/YinFWZ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ica3pp/YinFWZ21
Jiaying Yin, Jing Fu, Jingjin Wu, Shiming Zheng:
Energy Efficient Priority-Based Task Scheduling for Computation Offloading in Fog Computing. ICA3PP (1) 2021: 564-577
2018
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/globecom/WangFWMZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/globecom/WangFWMZ18
Qing Wang, Jing Fu, Jingjin Wu, Bill Moran, Moshe Zukerman:
Energy-Efficient Priority-Based Scheduling for Wireless Network Slicing. GLOBECOM 2018: 1-6

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.