default search action
Zijun Wu 0001
Person information
- affiliation: Hefei University, School of Artificial Intelligence and Big Data, Anhui, China
- affiliation (former): Beijing University of Technology, Department of Applied Mathematics and Physics, China
- affiliation (PhD 2015): TU Clausthal, Clausthal-Zellerfeld, Germany
Other persons with the same name
- Zijun Wu — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j8]Zijun Wu
, Rolf H. Möhring
A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games. Math. Oper. Res. 48(3): 1364-1392 (2023) - [j7]Zijun Wu, Rolf H. Möhring
A convergence analysis of the price of anarchy in atomic congestion games. Math. Program. 199(1): 937-993 (2023) - [j6]Chunying Ren, Zijun Wu, Dachuan Xu
A game-theoretic perspective of deep neural networks. Theor. Comput. Sci. 939: 48-62 (2023) - 2022
- [i8]Chunying Ren, Zijun Wu, Dachuan Xu
ρ/(1-ε)-approximate pure Nash equilibria algorithms for weighted congestion games and their runtimes. CoRR abs/2208.11309 (2022) - 2021
- [j5]Zijun Wu
Selfishness Need Not Be Bad. Oper. Res. 69(2): 410-435 (2021) - [c5]Chunying Ren, Zijun Wu, Dachuan Xu
A Game-Theoretic Analysis of Deep Neural Networks. AAIM 2021: 369-379 - 2020
- [i7]Zijun Wu, Rolf H. Möhring:
A sensitivity analysis for the price of anarchy in non-atomic congestion games. CoRR abs/2007.13979 (2020) - [i6]Zijun Wu, Rolf H. Möhring, Chunying Ren, Dachuan Xu:
A convergence analysis of the price of anarchy in atomic congestion games. CoRR abs/2007.14769 (2020)
2010 – 2019
- 2019
- [j4]Michael Kolonko, Feng Gu, Zijun Wu:
Improving the statistical quality of random number generators by applying a simple ratio transformation. Math. Comput. Simul. 157: 130-142 (2019) - [c4]Thomas Weise, Zijun Wu, Markus Wagner
An Improved Generic Bet-and-Run Strategy with Performance Prediction for Stochastic Local Search. AAAI 2019: 2395-2402 - 2018
- [j3]Zijun Wu, Rolf H. Möhring, Jianhui Lai:
Stochastic runtime analysis of a Cross-Entropy algorithm for traveling salesman problems. Theor. Comput. Sci. 724: 69-86 (2018) - [c3]Thomas Weise, Zijun Wu:
Difficult features of combinatorial optimization problems and the tunable w-model benchmark problem for simulating them. GECCO (Companion) 2018: 1769-1776 - [i5]Zijun Wu, Rolf H. Möhring, Dachuan Xu:
Selfishness need not be bad: a general proof. CoRR abs/1805.07762 (2018) - [i4]Thomas Weise, Zijun Wu, Markus Wagner:
An Improved Generic Bet-and-Run Strategy for Speeding Up Stochastic Local Search. CoRR abs/1806.08984 (2018) - 2017
- [j2]Zijun Wu
Stochastic Runtime Analysis of the Cross-Entropy Algorithm. IEEE Trans. Evol. Comput. 21(4): 616-628 (2017) - [i3]Zijun Wu, Rolf H. Möhring, Yanyan Chen:
Selfishness need not be bad. CoRR abs/1712.07464 (2017) - 2016
- [i2]Zijun Wu, Rolf H. Möhring, Jianhui Lai:
Stochastic Runtime Analysis of a Cross Entropy Algorithm for Traveling Salesman Problems. CoRR abs/1612.06962 (2016) - [i1]Michael Kolonko, Zijun Wu, Feng Gu:
Improving the Quality of Random Number Generators by Applying a Simple Ratio Transformation. CoRR abs/1612.07318 (2016) - 2015
- [c2]Maryam Pazouki, Zijun Wu, Zhixing Yang, Dietmar P. F. Möller:
An efficient learning method for RBF Neural Networks. IJCNN 2015: 1-6 - 2014
- [j1]Zijun Wu, Michael Kolonko:
Asymptotic Properties of a Generalized Cross-Entropy Optimization Algorithm. IEEE Trans. Evol. Comput. 18(5): 658-673 (2014) - [c1]Zijun Wu, Michael Kolonko:
Absorption in model-based search algorithms for combinatorial optimization. IEEE Congress on Evolutionary Computation 2014: 1744-1751
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-08-10 00:33 CEST 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: