default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLilian Besson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j2]Lilian Besson, Emilie Kaufmann, Odalric-Ambrym Maillard, Julien Seznec:
Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits. J. Mach. Learn. Res. 23: 77:1-77:40 (2022)- 2020
- [j1]Christophe Moy
, Lilian Besson, Guillaume Delbarre, Laurent Toutain:
Decentralized spectrum learning for radio collision mitigation in ultra-dense IoT networks: LoRaWAN case study and experiments. Ann. des Télécommunications 75(11): 711-727 (2020)
2010 – 2019
- 2019
- [b1]Lilian Besson:
Multi-Players Bandit Algorithms for Internet of Things Networks. (Algorithmes de Bandits Multi-Joueurs pour les Réseaux de l'Internet des Objets). Loire Bretagne University, France, 2019 - [c6]Christophe Moy, Lilian Besson:
Decentralized Spectrum Learning for IoT Wireless Networks Collision Mitigation. DCOSS 2019: 644-651 - [c5]Lilian Besson, Rémi Bonnefoi, Christophe Moy:
GNU Radio Implementation of MALIN: "Multi-Armed bandits Learning for Internet-of-things Networks". WCNC 2019: 1-6 - [c4]Rémi Bonnefoi, Lilian Besson, Julio Manco-Vásquez, Christophe Moy:
Upper-Confidence Bound for Channel Selection in LPWA Networks with Retransmissions. WCNC Workshops 2019: 1-7 - [i7]Lilian Besson, Emilie Kaufmann:
The Generalized Likelihood Ratio Test meets klUCB: an Improved Algorithm for Piece-Wise Non-Stationary Bandits. CoRR abs/1902.01575 (2019) - [i6]Lilian Besson, Rémi Bonnefoi, Christophe Moy:
GNU Radio Implementation of MALIN: "Multi-Armed bandits Learning for Internet-of-things Networks". CoRR abs/1902.01734 (2019) - [i5]Rémi Bonnefoi, Lilian Besson, Julio Manco-Vásquez, Christophe Moy:
Upper-Confidence Bound for Channel Selection in LPWA Networks with Retransmissions. CoRR abs/1902.10615 (2019) - [i4]Christophe Moy, Lilian Besson:
Decentralized Spectrum Learning for IoT Wireless Networks Collision Mitigation. CoRR abs/1906.00614 (2019) - 2018
- [c3]Lilian Besson, Emilie Kaufmann:
{Multi-Player Bandits Revisited}. ALT 2018: 56-92 - [c2]Lilian Besson, Emilie Kaufmann, Christophe Moy:
Aggregation of multi-armed bandits learning algorithms for opportunistic spectrum access. WCNC 2018: 1-6 - [i3]Lilian Besson, Emilie Kaufmann:
What Doubling Tricks Can and Can't Do for Multi-Armed Bandits. CoRR abs/1803.06971 (2018) - [i2]Rémi Bonnefoi, Lilian Besson, Christophe Moy, Emilie Kaufmann, Jacques Palicot:
Multi-Armed Bandit Learning in IoT Networks: Learning helps even in non-stationary settings. CoRR abs/1807.00491 (2018) - 2017
- [c1]Rémi Bonnefoi, Lilian Besson, Christophe Moy, Emilie Kaufmann, Jacques Palicot:
Multi-Armed Bandit Learning in IoT Networks: Learning Helps Even in Non-stationary Settings. CrownCom 2017: 173-185 - [i1]Lilian Besson, Emilie Kaufmann:
Multi-Player Bandits Models Revisited. CoRR abs/1711.02317 (2017)
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-09-13 01:39 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:
