![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Shiming Yu
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c5]Shiming Yu
, Xianjin Xia
, Ningning Hou
, Yuanqing Zheng
, Tao Gu
:
Revolutionizing LoRa Gateway with XGate: Scalable Concurrent Transmission across Massive Logical Channels. MobiCom 2024: 482-496 - 2023
- [j10]Jian Su
, Shiming Yu, Bin Li
, Yinghui Ye
:
Distributed and Collective Intelligence for Computation Offloading in Aerial Edge Networks. IEEE Trans. Intell. Transp. Syst. 24(7): 7516-7526 (2023) - 2021
- [j9]Yunbo Zhao, Xiaokang Pan, Shiming Yu:
Predictive Event-Triggered Control for Disturbanced Wireless Networked Control Systems. J. Syst. Sci. Complex. 34(3): 1028-1043 (2021) - 2020
- [j8]Jian Su, Ruoyu Xu, Shiming Yu, Baowei Wang, Jiuru Wang:
Idle Slots Skipped Mechanism based Tag Identification Algorithm with Enhanced Collision Detection. KSII Trans. Internet Inf. Syst. 14(5): 2294-2309 (2020)
2010 – 2019
- 2018
- [j7]Defeng He, Shiming Yu, Linlin Ou:
Lexicographic MPC with multiple economic criteria for constrained nonlinear systems. J. Frankl. Inst. 355(2): 753-773 (2018) - 2017
- [j6]Zhenzhen Man, Shiming Yu, Defeng He:
基于改进伊藤算法的最短路径网络路由优化算法 (Shortest Path Network Routing Optimization Algorithm Based on Improved ITO Algorithm). 计算机科学 44(7): 215-220 (2017) - 2016
- [j5]Mao Hua, Shiming Yu:
一种改进的混沌伊藤算法求解车辆配送问题 (Modified Chaotic ITO Algorithm to Vehicle Routing Problem). 计算机科学 43(3): 266-270 (2016) - [j4]Lihong Zhang, Shiming Yu:
求解置换流水线调度问题的改进萤火虫优化算法 (Improved GSO Algorithm for Solving PFSP). 计算机科学 43(8): 240-243 (2016) - [j3]Zhiyang Yin, Shiming Yu:
求解环境车辆路径问题的多种群伊藤算法 (Multigroup ITO Algorithm for Solving EVRP). 计算机科学 43(12): 260-263 (2016) - 2015
- [j2]Haoguang Wang, Shiming Yu:
求解车辆路径问题的改进伊藤算法 (Improved ITO Algorithm for Solving VRP). 计算机科学 42(9): 253-256 (2015) - [j1]Peng Hong, Shiming Yu:
基于时间序列分析的自动售货机销量预测 (Vending Machine Sales Forecasting Based on Time Series Analysis). 计算机科学 42(Z6): 122-124 (2015) - 2014
- [c4]Defeng He, Shiming Yu, Xiulan Song:
Lyapunov-based dual-mode method for economic optimization model predictive control. CDC 2014: 3505-3510
2000 – 2009
- 2003
- [c3]Shiming Yu, Li Yu, Hai-Qing Wang:
Constrained generalized predictive control algorithm with PID feedback correction scheme. ACC 2003: 379-383 - [c2]Li Yu, Qing-Long Han, Shiming Yu, Jinfeng Gao:
Delay-dependent conditions for robust absolute stability of uncertain time-delay systems. CDC 2003: 6033-6037 - [c1]Gang Xiao, Shiming Yu, Li Yu:
MPC-based computer network control strategy with stochastic time delay. SMC 2003: 3864-3869
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-06-19 21:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint