Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Gai, Yi"'
Autor:
Pei, Wenya, Xu, Wentian, Li, Henan, Yan, Liping, Gai, Yi, Yang, Nan, Yang, Jun, Chen, Jinliang, Peng, Honglin, Pape, Thomas, Zhang, Dong, Zhang, Chuntian
Publikováno v:
In International Journal of Biological Macromolecules February 2024 258 Part 2
Autor:
Chen, Li-Ye, Gai, Yi-Nuo, Gai, Xiao-Tang, Qin, Jun, Wang, Ze-Gang, Cui, Li-Sheng, Guo, Hu, Jiang, Meng-Ying, Zou, Qian, Zhou, Tao, Gai, Jing-Gang
Publikováno v:
In Chemical Engineering Journal 15 February 2022 430 Part 3
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Gai, Yi, Krishnamachari, Bhaskar
Water-filling is the term for the classic solution to the problem of allocating constrained power to a set of parallel channels to maximize the total data-rate. It is used widely in practice, for example, for power allocation to sub-carriers in multi
Externí odkaz:
http://arxiv.org/abs/1109.2088
Combinatorial network optimization algorithms that compute optimal structures taking into account edge weights form the foundation for many network protocols. Examples include shortest path routing, minimal spanning tree computation, maximum weighted
Externí odkaz:
http://arxiv.org/abs/1109.1606
The problem of opportunistic spectrum access in cognitive radio networks has been recently formulated as a non-Bayesian restless multi-armed bandit problem. In this problem, there are N arms (corresponding to channels) and one player (corresponding t
Externí odkaz:
http://arxiv.org/abs/1109.1552
In the classic Bayesian restless multi-armed bandit (RMAB) problem, there are $N$ arms, with rewards on all arms evolving at each time as Markov chains with known parameters. A player seeks to activate $K \geq 1$ arms at each time in order to maximiz
Externí odkaz:
http://arxiv.org/abs/1109.1533
We introduce the Funding Game, in which $m$ identical resources are to be allocated among $n$ selfish agents. Each agent requests a number of resources $x_i$ and reports a valuation $\tilde{v}_i(x_i)$, which verifiably {\em lower}-bounds $i$'s true v
Externí odkaz:
http://arxiv.org/abs/1107.2432
We consider a fundamental game theoretic problem concerning selfish users contributing packets to an M/M/1 queue. In this game, each user controls its own input rate so as to optimize a desired tradeoff between throughput and delay. We first show tha
Externí odkaz:
http://arxiv.org/abs/1106.3858
Autor:
Gai, Yi, Krishnamachari, Bhaskar
The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently as a decentralized multi-armed bandit (D-MAB) problem. In a D-MAB problem
Externí odkaz:
http://arxiv.org/abs/1104.0111