Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Ran Duan

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 Weiguo Dong

> Home > Persons > Ran Duan

Publications

2020
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/iotj/CaoPLDDYWC20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iotj/CaoPLDDYWC20
Jiaqi Cao, Tao Peng, Xin Liu, Weiguo Dong, Ran Duan, Yannan Yuan, Wenbo Wang, Shuguang Cui:
Resource Allocation for Ultradense Networks With Machine-Learning-Based Interference Graph Construction. IEEE Internet Things J. 7(3): 2137-2151 (2020)
2019
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/0001CLDDY019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/0001CLDDY019
Tao Peng, Jiaqi Cao, Xin Liu, Weiguo Dong, Ran Duan, Yannan Yuan, Wenbo Wang:
A Data-Driven and Load-Aware Interference Management Approach for Ultra-Dense Networks. IEEE Access 7: 129514-129528 (2019)
2018
[c37]
- view
  authority control:
- export record
  dblp key:
  - conf/globecom/CaoLDPDYW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/globecom/CaoLDPDYW18
Jiaqi Cao, Xin Liu, Weiguo Dong, Tao Peng, Ran Duan, Yannan Yuan, Wenbo Wang:
A Neural Network Based Conflict-Graph Construction Approach for Ultra-Dense Networks. GLOBECOM Workshops 2018: 1-6

a service of

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.