Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChao Bian 0002
Person information
- affiliation: Nanjing University, Nanjing, China
- affiliation (former): University of Science and Technology, Hefei, China
Other persons with the same name
- Chao Bian 0001 — Chinese Academy of Sciences, Beijing, China
- Chao Bian 0004
![[0000-0002-2653-0523]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-2653-0523")
— University of Toronto, Canada - Chao Bian 0005 — Tencent Technology Co., Ltd
- Chao Bian 0006 — ByteDance Lark AI, Beijing, China
- Chao Bian 0007 — Dalian University of Technology, School of Energy and Power Engineering, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Yu-Ran Gu, Chao Bian, Miqing Li, Chao Qian:
Subset Selection for Evolutionary Multiobjective Optimization. IEEE Trans. Evol. Comput. 28(2): 403-417 (2024)- [c14]Tianhao Lu, Chao Bian, Chao Qian:
Towards Running Time Analysis of Interactive Multi-Objective Evolutionary Algorithms. AAAI 2024: 20777-20785 - [c13]Zeqiong Lv, Chao Bian, Chao Qian, Yanan Sun:
Runtime Analysis of Population-based Evolutionary Neural Architecture Search for a Binary Classification Problem. GECCO 2024 - [i11]Chao Bian, Shengjie Ren, Miqing Li, Chao Qian:
An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms. CoRR abs/2406.02118 (2024) - [i10]Shengjie Ren, Zhijia Qiu, Chao Bian, Miqing Li, Chao Qian:
Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization. CoRR abs/2406.02658 (2024) - 2023
- [c12]Yu-Ran Gu, Chao Bian, Chao Qian:
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. AAAI 2023: 3959-3967 - [c11]Chao Bian, Yawen Zhou, Miqing Li, Chao Qian:
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms. IJCAI 2023: 5513-5521 - [i9]Chao Bian, Yawen Zhou, Miqing Li, Chao Qian:
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms. CoRR abs/2306.02611 (2023) - [i8]Yu-Ran Gu, Chao Bian, Chao Qian:
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints. CoRR abs/2307.09487 (2023) - [i7]Tianhao Lu, Chao Bian, Chao Qian:
Towards Running Time Analysis of Interactive Multi-objective Evolutionary Algorithms. CoRR abs/2310.08384 (2023) - 2022
- [c10]Chao Bian, Yawen Zhou, Chao Qian:
Robust Subset Selection by Greedy and Evolutionary Pareto Optimization. IJCAI 2022: 4726-4732 - [c9]Chao Bian, Chao Qian:
Better Running Time of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) by Using Stochastic Tournament Selection. PPSN (2) 2022: 428-441 - [c8]Zi-An Zhang, Chao Bian, Chao Qian:
Running Time Analysis of the (1+1)-EA Using Surrogate Models on OneMax and LeadingOnes. PPSN (2) 2022: 512-525 - [i6]Chao Bian, Chao Qian:
Running Time Analysis of the Non-dominated Sorting Genetic Algorithm II (NSGA-II) using Binary or Stochastic Tournament Selection. CoRR abs/2203.11550 (2022) - [i5]Chao Bian, Yawen Zhou, Chao Qian:
Robust Subset Selection by Greedy and Evolutionary Pareto Optimization. CoRR abs/2205.01415 (2022) - 2021
- [j4]Chao Qian, Chao Bian, Yang Yu, Ke Tang, Xin Yao:
Analysis of Noisy Evolutionary Optimization When Sampling Fails. Algorithmica 83(4): 940-975 (2021) - [j3]Chao Bian, Chao Qian, Yang Yu, Ke Tang:
On the robustness of median sampling in noisy evolutionary optimization. Sci. China Inf. Sci. 64(5) (2021) - [c7]Chao Bian, Chao Qian, Frank Neumann, Yang Yu:
Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints. IJCAI 2021: 2191-2197 - 2020
- [j2]Chao Bian, Chao Qian, Ke Tang, Yang Yu:
Running time analysis of the (1+1)-EA for robust linear optimization. Theor. Comput. Sci. 843: 57-72 (2020) - [c6]Chao Qian, Chao Bian, Chao Feng:
Subset Selection by Pareto Optimization with Recombination. AAAI 2020: 2408-2415 - [c5]Chao Bian, Chao Feng, Chao Qian, Yang Yu:
An Efficient Evolutionary Algorithm for Subset Selection with General Cost Constraints. AAAI 2020: 3267-3274
2010 – 2019
- 2019
- [j1]Chao Qian, Chao Bian, Wu Jiang, Ke Tang:
Running Time Analysis of the ( $$1+1$$ 1 + 1 )-EA for OneMax and LeadingOnes Under Bit-Wise Noise. Algorithmica 81(2): 749-795 (2019) - [i4]Chao Bian, Chao Qian, Ke Tang:
Running Time Analysis of the (1+1)-EA for Robust Linear Optimization. CoRR abs/1906.06873 (2019) - [i3]Chao Bian, Chao Qian, Yang Yu:
On the Robustness of Median Sampling in Noisy Evolutionary Optimization. CoRR abs/1907.13100 (2019) - 2018
- [c4]Chao Qian, Chao Bian, Yang Yu, Ke Tang, Xin Yao:
Analysis of noisy evolutionary optimization when sampling fails. GECCO 2018: 1507-1514 - [c3]Chao Bian, Chao Qian, Ke Tang:
A General Approach to Running Time Analysis of Multi-objective Evolutionary Algorithms. IJCAI 2018: 1405-1411 - [c2]Chao Bian, Chao Qian, Ke Tang:
Towards a Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes Under General Bit-Wise Noise. PPSN (2) 2018: 165-177 - [i2]Chao Qian, Chao Bian, Yang Yu, Ke Tang, Xin Yao:
Analysis of Noisy Evolutionary Optimization When Sampling Fails. CoRR abs/1810.05045 (2018) - 2017
- [c1]Chao Qian, Chao Bian, Wu Jiang, Ke Tang:
Running time analysis of the (1+1)-EA for onemax and leadingones under bit-wise noise. GECCO 2017: 1399-1406 - [i1]Chao Qian, Chao Bian, Wu Jiang, Ke Tang:
Running Time Analysis of the (1+1)-EA for OneMax and LeadingOnes under Bit-wise Noise. CoRR abs/1711.00956 (2017)
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-07-10 20:41 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:
