Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Richard Combes"'
Publikováno v:
IEEE Transactions on Communications. 68:137-149
We consider a Device-to-Device (D2D) aided multicast channel, where a base station (BS) wishes to convey a common message to many receivers and these receivers cooperate with each other. We analyze the performance of a two-phase cooperative multicast
Publikováno v:
IEEE Transactions on Mobile Computing. 18:1145-1158
Rate Adaptation (RA) is a fundamental mechanism in 802.11 systems. It allows transmitters to adapt the coding and modulation scheme as well as the MIMO transmission mode to the radio channel conditions, to learn and track the (mode, rate) pair provid
Publikováno v:
SIGMETRICS ’21 Abstracts
SIGMETRICS 2021
SIGMETRICS 2021, ACM, Jun 2021, Virtual Event, China. ⟨10.1145/3410220.3453926⟩
Proceedings of the ACM on Measurement and Analysis of Computing Systems
ACM SIGMETRICS 2021
Proceedings of the ACM on Measurement and Analysis of Computing Systems, ACM, 2021, 5 (9), pp.1-31. ⟨10.1145/3447387⟩
SIGMETRICS (Abstracts)
SIGMETRICS 2021
SIGMETRICS 2021, ACM, Jun 2021, Virtual Event, China. ⟨10.1145/3410220.3453926⟩
Proceedings of the ACM on Measurement and Analysis of Computing Systems
ACM SIGMETRICS 2021
Proceedings of the ACM on Measurement and Analysis of Computing Systems, ACM, 2021, 5 (9), pp.1-31. ⟨10.1145/3447387⟩
SIGMETRICS (Abstracts)
International audience; We consider combinatorial semi-bandits over a set X ⊂ {0, 1} d where rewards are uncorrelated across items. For this problem, the algorithm ESCB yields the smallest known regret bound R(T) = O d (ln m) 2 (ln T) ∆ min after
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d804d81ab8e162d78d27572317ca930
https://hal.archives-ouvertes.fr/hal-03201526
https://hal.archives-ouvertes.fr/hal-03201526
Publikováno v:
Proceedings of Machine Learning Research
Algorithmic Learning Theory
Algorithmic Learning Theory, Mar 2021, Paris, France
HAL
Algorithmic Learning Theory
Algorithmic Learning Theory, Mar 2021, Paris, France
HAL
We consider combinatorial semi-bandits with uncorrelated Gaussian rewards. In this article, we propose the first method, to the best of our knowledge, that enables to compute the solution of the Graves-Lai optimization problem in polynomial time for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e79832d45f8cb6190226a9317f9a97af
https://hal.archives-ouvertes.fr/hal-03162140/document
https://hal.archives-ouvertes.fr/hal-03162140/document
Publikováno v:
IEEE Transactions on Automatic Control
IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2017, 63 (4), pp.915-930. ⟨10.1109/TAC.2017.2747409⟩
IEEE Transactions on Automatic Control, 2017, 63 (4), pp.915-930. ⟨10.1109/TAC.2017.2747409⟩
IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2017, 63 (4), pp.915-930. ⟨10.1109/TAC.2017.2747409⟩
IEEE Transactions on Automatic Control, 2017, 63 (4), pp.915-930. ⟨10.1109/TAC.2017.2747409⟩
This paper studies online shortest path routing over multi-hop networks. Link costs or delays are time-varying and modeled by independent and identically distributed random processes, whose parameters are initially unknown. The parameters, and hence
Publikováno v:
GLOBECOM
We propose a novel resource allocation scheme for Ultra- Reliable and Low Latency communication (URLLC) traffic in the uplink of 5G systems. We consider industrial scenarios where a set of machines transmit packets intermittently to a central control
Publikováno v:
Allerton
In this presentation, we address generic multi-armed bandit problems with stochastic rewards and known structure. Our notion of structure is generic and includes well-studied bandit structures such as linear, combinatorial, unimodal, Lipschitz, dueli
Publikováno v:
ISIT
We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a naive application of coded caching over the channel at hand performs poor
Publikováno v:
ISIT
We consider a device-to-device (D2D) aided multicast channel, where a transmitter wishes to convey a common message to many receivers and these receivers cooperate with each other. We propose a simple computationally efficient scheme requiring only s
Publikováno v:
GLOBECOM
GLOBECOM 2017-2017 IEEE Global Communications Conference
GLOBECOM 2017-2017 IEEE Global Communications Conference, Dec 2017, Singapore, Singapore. ⟨10.1109/glocom.2017.8254966⟩
GLOBECOM 2017-2017 IEEE Global Communications Conference
GLOBECOM 2017-2017 IEEE Global Communications Conference, Dec 2017, Singapore, Singapore. ⟨10.1109/glocom.2017.8254966⟩
We consider content delivery over fading broadcast channels. A server wants to transmit K files to K users, each equipped with a cache of finite size. Using the coded caching scheme of Maddah-Ali and Niesen, we design an opportunistic delivery scheme