default search action
Hejun Xuan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j12]Hejun Xuan, Yi Zhou, Xuelin Zhao, Zhenghui Liu:
Multi-agent deep reinforcement learning algorithm with self-adaption division strategy for VNF-SC deployment in SDN/NFV-Enabled Networks. Appl. Soft Comput. 138: 110189 (2023) - 2022
- [c6]Hejun Xuan, Lidan Lin, Zhenghui Liu, Xuelin Zhao:
Load balance and time delay efficient algorithm for VNF service chain deployment based on DQN. CIS 2022: 440-444 - 2021
- [j11]Hejun Xuan
, Xuelin Zhao, Lei You
Multiobjective Model and Improved Artificial Raindrop Algorithm for Virtual Network Mapping. Mob. Inf. Syst. 2021: 5542670:1-5542670:10 (2021) - [j10]Jian Li
Unified Model Solving Nine Types of Time-Varying Problems in the Frame of Zeroing Neural Network. IEEE Trans. Neural Networks Learn. Syst. 32(5): 1896-1905 (2021) - [j9]Hejun Xuan
Energy Efficiency Opposition-Based Learning and Brain Storm Optimization for VNF-SC Deployment in IoT. Wirel. Commun. Mob. Comput. 2021: 6651112:1-6651112:9 (2021) - 2020
- [j8]Hejun Xuan
A New Bi-Level Mathematical Model and Algorithm for VONs Mapping Problem. IEEE Access 8: 101797-101811 (2020) - [j7]Hejun Xuan
General Third-Order-Accuracy Formulas for Time Discretization Applied to Time-Varying Optimization. IEEE Access 8: 224235-224245 (2020)
2010 – 2019
- 2019
- [j6]Hejun Xuan
Off-Line Time Aware Scheduling of Bag-of-Tasks on Heterogeneous Distributed System. IEEE Access 7: 104777-104788 (2019) - [j5]Xiaopeng Yang
Improved Lattice-Based Signcryption in the Standard Model. IEEE Access 7: 155552-155562 (2019) - [j4]Hejun Xuan
Bi-Level Programming Model and Algorithm for VNF Deployment With Data Centers Placement. IEEE Access 7: 185760-185772 (2019) - [j3]Hejun Xuan
Grey Wolf Algorithm and Multi-Objective Model for the Manycast RSA Problem in EONs. Inf. 10(12): 398 (2019) - [j2]Wei Yue, Yuping Wang, Hejun Xuan:
Fuzzy multi-objective portfolio model based on semi-variance-semi-absolute deviation risk measures. Soft Comput. 23(17): 8159-8179 (2019) - 2018
- [j1]Hejun Xuan
Fault-Tolerant Scheduling Algorithm With Re-Allocation for Divisible Task. IEEE Access 6: 73147-73157 (2018) - [c5]Jiading Wang, Hejun Xuan, Yuping Wang, Yuanchao Yang, Sen Liu:
Optimization Model and Algorithm for Routing and Spectrum Assignment in Elastic Optical Networks. CIS 2018: 306-310 - 2017
- [c4]Hejun Xuan, Yuping Wang, Shiwei Guan, Zhanqi Xu:
A New Optimization Model and Algorithm for a Network Scheduling Problem in Inter-Datacenters Elastic Optical Networks. CIS 2017: 30-34 - 2016
- [c3]Hejun Xuan, Yuping Wang, Shanshan Hao, Xiaoli Wang:
Multi-objective scheduling for divisible load in heterogeneous distributed system. CEC 2016: 3378-3384 - [c2]Hejun Xuan, Yuping Wang, Shanshan Hao, Zhanqi Xu, Xiaodong Li, Xiaozhi Gao:
Security-Aware Routing and Core Allocation in Elastic Optical Network with Multi-core. CIS 2016: 294-298 - 2015
- [c1]Hejun Xuan, Yuping Wang, Shanshan Hao, Xiaoli Wang:
Cost-Efficient Divisible Load Scheduling Using Genetic Algorithm. CIS 2015: 14-17
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 21:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: