default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChengyan Zhao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j4]Hengyi Li, Xuebin Yue, Chengyan Zhao
, Lin Meng:
Lightweight deep neural network from scratch. Appl. Intell. 53(15): 18868-18886 (2023)- [j3]Chengyan Zhao, Bohao Zhu, Masaki Ogura, James Lam:
Parameterized Synthesis of Discrete-Time Positive Linear Systems: A Geometric Programming Perspective. IEEE Control. Syst. Lett. 7: 2551-2556 (2023) - [j2]Chengyan Zhao, Kazunori Sakurama, Masaki Ogura:
Optimization of Buffer Networks via DC Programming. IEEE Trans. Circuits Syst. II Express Briefs 70(2): 606-610 (2023) - [c4]Gai Liu, Umar Farooq, Chengyan Zhao, Xia Liu, Nian Sun:
Linker Code Size Optimization for Native Mobile Applications. CC 2023: 168-179 - [i7]Wenjie Mei, Yu Zhou, Ahmad Taha, Chengyan Zhao:
On input-to-state stability verification of identified models obtained by Koopman operator. CoRR abs/2309.01242 (2023) - 2022
- [i6]Chengyan Zhao, Kazunori Sakurama, Masaki Ogura:
Optimization of stochastic switching buffer network via DC programming. CoRR abs/2207.08362 (2022) - [i5]Gai Liu, Umar Farooq, Chengyan Zhao, Xia Liu, Nian Sun:
Linker Code Size Optimization for Native Mobile Applications. CoRR abs/2210.07311 (2022) - 2020
- [c3]Chengyan Zhao, Masaki Ogura, Kenji Sugimoto:
Finite-time Control of Discrete-time Positive Linear Systems via Convex Optimization. SICE 2020: 1230-1235 - [i4]Chengyan Zhao, Masaki Ogura, Masako Kishida, Ali Yassine:
Optimal Resource Allocation for Dynamic Product Development Process via Convex Optimization. CoRR abs/2002.08783 (2020) - [i3]Chengyan Zhao, Masaki Ogura, Kenji Sugimoto:
Finite-time Control of Discrete-time Positive Linear Systems via Convex Optimization. CoRR abs/2008.01024 (2020)
2010 – 2019
- 2019
- [j1]Yongquan Zhou, Rui Wang, Chengyan Zhao, Qifang Luo, Mohamed A. Metwally:
Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput. Appl. 31(7): 2155-2170 (2019) - [i2]Chengyan Zhao, Masaki Ogura, Kenji Sugimoto:
Stability Optimization of Positive Semi-Markov Jump Linear Systems via Convex Optimization. CoRR abs/1904.11690 (2019) - [i1]Wenjie Mei, Chengyan Zhao, Masaki Ogura, Kenji Sugimoto:
Mixed $H_2/H_{\infty}$ Control for Markov Jump Linear Systems with State and Mode-observation Delays. CoRR abs/1908.04001 (2019) - 2016
- [c2]Chengyan Zhao, Yongquan Zhou:
A Complex Encoding Flower Pollination Algorithm for Global Numerical Optimization. ICIC (1) 2016: 667-678 - 2013
- [c1]Michael C. Delorme, Tarek S. Abdelrahman, Chengyan Zhao:
Parallel Radix Sort on the AMD Fusion Accelerated Processing Unit. ICPP 2013: 339-348
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-04-24 22:50 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:
