default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChao Feng 0006
Person information
- affiliation: University of Science and Technology of China, School of Computer Science and Technology, Hefei, China
- affiliation: Anhui Province Key Lab of Big Data Analysis and Application, Hefei, China
Other persons with the same name
- Chao Feng — disambiguation page
- Chao Feng 0001
![[0000-0002-0672-1090]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-0672-1090")
— University of Zurich UZH, Communication Systems Group CSG, Department of Informatics IfI, Switzerland - Chao Feng 0002 — National University of Defense Technology (NUDT), College of Electronic Science, Changsha, China
- Chao Feng 0003 — Qilu University of Technology, Shandong Academy of Sciences, International School for Optoelectronic Engineering, Jinan, China
- Chao Feng 0004 — Northwest University, Shaanxi International Joint Research Centre for the Battery-Free Internet of Things, China
- Chao Feng 0005 — Pennsylvania State University, Electrical Engineering Department, PA, USA
- Chao Feng 0007 — Southeast University, National Mobile Communications Research Laboratory, Nanjing, China
- Chao Feng 0008 — University of Science and Technology of China, School of Computer Science and Technology, Hefei, Anhui, China
- Chao Feng 0009 — Land Mobile Product Sector, Motorola, Inc., IL, USA (and 1 more)
- Chao Feng 0010 — Zhejiang University, College of Computer Science and Technology, Hangzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j1]Chao Qian, Dan-Xuan Liu, Chao Feng, Ke Tang:
Multi-objective evolutionary algorithms are generally good: Maximizing monotone submodular functions over sequences. Theor. Comput. Sci. 943: 241-266 (2023)- 2021
- [c6]Chao Feng, Chao Qian:
Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee. AAAI 2021: 12302-12310 - [i1]Chao Qian, Dan-Xuan Liu, Chao Feng, Ke Tang:
Multi-objective Evolutionary Algorithms are Generally Good: Maximizing Monotone Submodular Functions over Sequences. CoRR abs/2104.09884 (2021) - 2020
- [c5]Chao Qian, Chao Bian, Chao Feng:
Subset Selection by Pareto Optimization with Recombination. AAAI 2020: 2408-2415 - [c4]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
- [c3]Chao Feng, Chao Qian, Ke Tang:
Unsupervised Feature Selection by Pareto Optimization. AAAI 2019: 3534-3541 - 2018
- [c2]Chao Qian, Chao Feng, Ke Tang:
Sequence Selection by Pareto Optimization. IJCAI 2018: 1485-1491 - [c1]Chao Qian, Guiying Li, Chao Feng, Ke Tang:
Distributed Pareto Optimization for Subset Selection. IJCAI 2018: 1492-1498
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 2026-01-28 02:12 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:
