Zhiheng Wang

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 Jianhua Liu

> Home > Persons > Zhiheng Wang

Publications

2022
[j23]
- view
  authority control:
- export record
  dblp key:
  - journals/jifs/LiuW22b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jifs/LiuW22b
Jianhua Liu, Zhiheng Wang:
Artificial immune algorithm-sparrow search algorithm and its application in network intrusion detection. J. Intell. Fuzzy Syst. 43(4): 5001-5011 (2022)
2021
[j20]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/ZhihengJ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/ZhihengJ21
Zhiheng Wang, Jianhua Liu:
Flamingo Search Algorithm: A New Swarm Intelligence Optimization Algorithm. IEEE Access 9: 88564-88582 (2021)
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/access/JianhuaZ21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/JianhuaZ21
Jianhua Liu, Zhiheng Wang:
A Hybrid Sparrow Search Algorithm Based on Constructing Similarity. IEEE Access 9: 117581-117595 (2021)
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/aipr2/WangL21a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aipr2/WangL21a
Zhiheng Wang, Jianhua Liu:
Flamingo Search Algorithm and Its Application to Path Planning Problem. AIPR 2021: 567-573

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.