default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYi Gai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j3]Yi Gai, Hua Liu, Bhaskar Krishnamachari:
A packet dropping mechanism for efficient operation of M/M/1 queues with selfish users. Comput. Networks 98: 1-13 (2016)- [p1]Yi Gai, Jian Lin, Bhaskar Krishnamachari:
Security and Privacy in Vehicular Networks: Challenges and Algorithm. Cognitive Vehicular Networks 2016: 151-168 - 2015
- [c17]Yi Gai, Jing Zhu, Rath Vannithamby:
Packet dropping with intra-flow prioritization for Internet video calls in mobile networks. WCNC 2015: 1398-1403 - 2014
- [j2]Yi Gai, Bhaskar Krishnamachari:
Distributed Stochastic Online Learning Policies for Opportunistic Spectrum Access. IEEE Trans. Signal Process. 62(23): 6184-6193 (2014) - [c16]Wenhan Dai, Yi Gai, Bhaskar Krishnamachari:
Online learning for multi-channel opportunistic access over unknown Markovian channels. SECON 2014: 64-71 - 2012
- [j1]Yi Gai, Bhaskar Krishnamachari, Rahul Jain
:
Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations. IEEE/ACM Trans. Netw. 20(5): 1466-1478 (2012) - [c15]Wenhan Dai, Yi Gai, Bhaskar Krishnamachari:
Efficient online learning for opportunistic spectrum access. INFOCOM 2012: 3086-3090 - [c14]Yi Gai, Bhaskar Krishnamachari:
Online learning algorithms for stochastic water-filling. ITA 2012: 352-356 - [c13]Yi Gai, Bhaskar Krishnamachari, Mingyan Liu:
Online learning for combinatorial network optimization with restless Markovian rewards. SECON 2012: 28-36 - [c12]Amotz Bar-Noy, Yi Gai, Matthew P. Johnson, Bhaskar Krishnamachari, George Rabanca:
Funding Games: The Truth but Not the Whole Truth. WINE 2012: 128-141 - 2011
- [c11]Naumaan Nayyar, Yi Gai, Bhaskar Krishnamachari:
On a restless multi-armed bandit problem with non-identical arms. Allerton 2011: 369-376 - [c10]Yi Gai, Bhaskar Krishnamachari:
Decentralized Online Learning Algorithms for Opportunistic Spectrum Access. GLOBECOM 2011: 1-6 - [c9]Yi Gai, Bhaskar Krishnamachari, Mingyan Liu:
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards. GLOBECOM 2011: 1-6 - [c8]Wenhan Dai, Yi Gai, Bhaskar Krishnamachari, Qing Zhao:
The non-Bayesian restless multi-armed bandit: A case of near-logarithmic regret. ICASSP 2011: 2940-2943 - [c7]Yi Gai, Hua Liu, Bhaskar Krishnamachari:
A packet dropping-based incentive mechanism for M/M/1 queues with selfish users. INFOCOM 2011: 2687-2695 - [c6]Yi Gai, Shankar Ganesan, Bhaskar Krishnamachari:
The saturation throughput region of p-persistent CSMA. ITA 2011: 116-119 - [i10]Yi Gai, Bhaskar Krishnamachari:
Decentralized Online Learning Algorithms for Opportunistic Spectrum Access. CoRR abs/1104.0111 (2011) - [i9]Yi Gai, Hua Liu, Bhaskar Krishnamachari:
A Packet Dropping Mechanism for Efficient Operation of M/M/1 Queues with Selfish Users. CoRR abs/1106.3858 (2011) - [i8]Amotz Bar-Noy, Yi Gai, Matthew P. Johnson, Bhaskar Krishnamachari, George Rabanca:
Knapsack Games and the Truth but not the Whole Truth. CoRR abs/1107.2432 (2011) - [i7]Wenhan Dai, Yi Gai, Bhaskar Krishnamachari, Qing Zhao:
The Non-Bayesian Restless Multi-Armed Bandit: A Case of Near-Logarithmic Strict Regret. CoRR abs/1109.1533 (2011) - [i6]Wenhan Dai, Yi Gai, Bhaskar Krishnamachari:
Efficient Online Learning for Opportunistic Spectrum Access. CoRR abs/1109.1552 (2011) - [i5]Yi Gai, Bhaskar Krishnamachari, Mingyan Liu:
Online Learning for Combinatorial Network Optimization with Restless Markovian Rewards. CoRR abs/1109.1606 (2011) - [i4]Yi Gai, Bhaskar Krishnamachari:
Online Learning Algorithms for Stochastic Water-Filling. CoRR abs/1109.2088 (2011) - 2010
- [c5]Pai-Han Huang, Yi Gai, Bhaskar Krishnamachari, Ashwin Sridharan:
Subcarrier Allocation in Multiuser OFDM Systems: Complexity and Approximability. WCNC 2010: 1-6 - [i3]Yi Gai, Bhaskar Krishnamachari, Rahul Jain:
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards. CoRR abs/1011.4748 (2010) - [i2]Wenhan Dai, Yi Gai, Bhaskar Krishnamachari, Qing Zhao:
The Non-Bayesian Restless Multi-Armed Bandit: a Case of Near-Logarithmic Regret. CoRR abs/1011.4752 (2010) - [i1]Yi Gai, Bhaskar Krishnamachari, Mingyan Liu:
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards. CoRR abs/1012.3005 (2010)
2000 – 2009
- 2009
- [c4]Peter D. Ungsunan, Chuang Lin, Yi Gai, Xiangzhen Kong:
Improving Multi-Core System Dependability with Asymmetrically Reliable Cores. CISIS 2009: 1252-1257 - [c3]Peter D. Ungsunan, Chuang Lin, Yang Wang, Yi Gai:
Network processing performability evaluation on heterogeneous reliability multicore processors using SRN model. IPDPS 2009: 1-6 - 2007
- [c2]Tianshi Gao, Lin Zhang, Yi Gai, Xiuming Shan:
Load-Balanced Cluster-Based Cooperative MIMO Transmission for Wireless Sensor Networks. ISWCS 2007: 602-606 - [c1]Yi Gai, Lin Zhang, Xiuming Shan:
Energy Efficiency of Cooperative MIMO with Data Aggregation in Wireless Sensor Networks. WCNC 2007: 791-796
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-25 05:48 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:
