default search action
Shengwei Zhou 0002
Person information
- affiliation: University of Macau, SAR, China
- unicode name: 周晟炜
Other persons with the same name
- Shengwei Zhou 0001 — Yangzhou University, College of Information Engineering, China
- Shengwei Zhou 0003 — Xidian University, National Laboratory of Radar Signal Processing, Xi'an, China
- Shengwei Zhou 0004 — Wenzhou University, College of Mechanical and Electrical Engineering, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j3]Yuhuan Lu, Wei Wang
, Rufan Bai, Shengwei Zhou, Lalit Garg, Ali Kashif Bashir, Weiwei Jiang, Xiping Hu:
Hyper-relational interaction modeling in multi-modal trajectory prediction for intelligent connected vehicles in smart cites. Inf. Fusion 114: 102682 (2025) - 2024
- [j2]Shengwei Zhou, Xiaowei Wu
Approximately EFX allocations for indivisible chores. Artif. Intell. 326: 104037 (2024) - [i8]Xiaowei Wu, Shengwei Zhou:
Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy. CoRR abs/2404.07707 (2024) - [i7]Jiawei Qiu, Xiaowei Wu, Cong Zhang, Shengwei Zhou:
Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores. CoRR abs/2410.12347 (2024) - 2023
- [j1]Yuhuan Lu
Vehicle Trajectory Prediction in Connected Environments via Heterogeneous Context-Aware Graph Convolutional Networks. IEEE Trans. Intell. Transp. Syst. 24(8): 8452-8464 (2023) - [c5]Shengwei Zhou, Rufan Bai, Xiaowei Wu:
Multi-agent Online Scheduling: MMS Allocations for Indivisible Items. ICML 2023: 42506-42516 - [c4]Xiaowei Wu
Weighted EF1 Allocations for Indivisible Chores. EC 2023: 1155 - [c3]Guoliang Qiu
Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching. WINE 2023: 527-544 - [c2]Xiaowei Wu
One Quarter Each (on Average) Ensures Proportionality. WINE 2023: 582-599 - [i6]Xiaowei Wu
Weighted EF1 Allocations for Indivisible Chores. CoRR abs/2301.08090 (2023) - [i5]Yilong Feng
Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching. CoRR abs/2302.05633 (2023) - [i4]Shengwei Zhou, Rufan Bai, Xiaowei Wu
Multi-agent Online Scheduling: MMS Allocations for Indivisible Items. CoRR abs/2304.13405 (2023) - [i3]Xiaowei Wu, Cong Zhang, Shengwei Zhou:
One Quarter Each (on Average) Ensures Proportionality. CoRR abs/2307.04411 (2023) - [i2]Biaoshuai Tao, Xiaowei Wu
On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores. CoRR abs/2308.12177 (2023) - 2022
- [c1]Shengwei Zhou
Approximately EFX Allocations for Indivisible Chores. IJCAI 2022: 783-789 - 2021
- [i1]Shengwei Zhou, Xiaowei Wu:
Approximately EFX Allocations for Indivisible Chores. CoRR abs/2109.07313 (2021)
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-12-13 20:05 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: