Siyu Jiang

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 Zefeng Chen

> Home > Persons > Siyu Jiang

Publications

2022
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/tcyb/ZhouHCJ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcyb/ZhouHCJ22
Yuren Zhou, Xiaoyu He, Zefeng Chen, Siyu Jiang:
A Neighborhood Regression Optimization Algorithm for Computationally Expensive Optimization Problems. IEEE Trans. Cybern. 52(5): 3018-3031 (2022)
2021
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/apin/JiangC21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apin/JiangC21
Siyu Jiang, Zefeng Chen:
A Two-phase evolutionary algorithm framework for multi-objective optimization. Appl. Intell. 51(6): 3952-3974 (2021)
2020
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/asc/HeZCJ20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/asc/HeZCJ20
Xiaoyu He, Yuren Zhou, Zefeng Chen, Siyu Jiang:
An evolutionary approach to black-box optimization on matrix manifolds. Appl. Soft Comput. 97(Part B): 106773 (2020)
2019
[c8]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/ijcai/ChenZHJ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ijcai/ChenZHJ19
Zefeng Chen, Yuren Zhou, Xiaoyu He, Siyu Jiang:
A Restart-based Rank-1 Evolution Strategy for Reinforcement Learning. IJCAI 2019: 2130-2136

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.