default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYige Hong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Yige Hong
, Ziv Scully:
Performance of the Gittins policy in the G/G/1 and G/G/k, with and without setup times. Perform. Evaluation 163: 102377 (2024)- [j6]Isaac Grosof, Yige Hong, Mor Harchol-Balter, Alan Scheller-Wolf:
The RESET and MARC Techniques, with Application to Multiserver-Job Analysis. SIGMETRICS Perform. Evaluation Rev. 51(4): 6-7 (2024) - [j5]Yige Hong, Ziv Scully:
Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup Times. SIGMETRICS Perform. Evaluation Rev. 51(4): 12-13 (2024) - [c3]Yige Hong, Qiaomin Xie, Weina Wang:
Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes. SIGMETRICS/Performance (Abstracts) 2024: 93-94 - [i8]Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang:
Unichain and Aperiodicity are Sufficient for Asymptotic Optimality of Average-Reward Restless Bandits. CoRR abs/2402.05689 (2024) - [i7]Isaac Grosof, Yige Hong, Mor Harchol-Balter:
Analysis of Markovian Arrivals and Service with Applications to Intermittent Overload. CoRR abs/2405.04102 (2024) - [i6]Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang:
When is exponential asymptotic optimality achievable in average-reward restless bandits? CoRR abs/2405.17882 (2024) - 2023
- [j4]Isaac Grosof, Yige Hong, Mor Harchol-Balter, Alan Scheller-Wolf:
The RESET and MARC techniques, with application to multiserver-job analysis. Perform. Evaluation 162: 102378 (2023) - [j3]Yige Hong, Qiaomin Xie, Weina Wang:
Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes. Proc. ACM Meas. Anal. Comput. Syst. 7(3): 48:1-48:46 (2023) - [j2]Yige Hong, Ziv Scully:
Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup Times. SIGMETRICS Perform. Evaluation Rev. 51(2): 33-35 (2023) - [c2]Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang:
Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption. NeurIPS 2023 - [i5]Yige Hong, Ziv Scully:
Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup Times. CoRR abs/2304.13231 (2023) - [i4]Yige Hong, Qiaomin Xie, Yudong Chen, Weina Wang:
Restless Bandits with Average Reward: Breaking the Uniform Global Attractor Assumption. CoRR abs/2306.00196 (2023) - [i3]Isaac Grosof, Yige Hong, Mor Harchol-Balter, Alan Scheller-Wolf:
The RESET and MARC Techniques, with Application to Multiserver-Job Analysis. CoRR abs/2310.01621 (2023) - 2022
- [j1]Yige Hong:
Sharp Zero-Queueing Bounds for Multi-Server Jobs. SIGMETRICS Perform. Evaluation Rev. 49(2): 66-68 (2022) - [c1]Yige Hong, Weina Wang:
Sharp waiting-time bounds for multiserver jobs. MobiHoc 2022: 161-170 - [i2]Yige Hong, Qiaomin Xie, Weina Wang:
Maximizing Utilization under Time-Varying Resource Requirements. CoRR abs/2209.04123 (2022) - 2021
- [i1]Yige Hong, Weina Wang:
Sharp Waiting-Time Bounds for Multiserver Jobs. CoRR abs/2109.05343 (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-07-20 21:15 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:
