Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Pierre Leone"'
Autor:
Pierre Leone, Nathan Cohen
Publikováno v:
Algorithms, Vol 15, Iss 2, p 41 (2022)
In this paper, we introduce a linear program (LP)-based formulation of a rendezvous game with markers on the infinite line and solve it. In this game one player moves at unit speed while the second player moves at a speed bounded by vmax≤1. We obse
Externí odkaz:
https://doaj.org/article/a63f9b51d83d4ef79c98ef6a39a8b8c8
Autor:
Pierre Leone, Elad M. Schiller
Publikováno v:
International Journal of Distributed Sensor Networks, Vol 9 (2013)
In dynamic wireless ad hoc networks (DynWANs), autonomous computing devices set up a network for the communication needs of the moment. These networks require the implementation of a medium access control (MAC) layer. We consider MAC protocols for Dy
Externí odkaz:
https://doaj.org/article/62fa3bb05fc54971aec42fa254e9388a
Autor:
Pierre Leone, Elad M. Schiller
Publikováno v:
International Journal of Distributed Sensor Networks, Vol 6 (2010)
We analyze a distributed variation on the Pólya urn process in which a network of tiny artifacts manages the individual urns. Neighboring urns interact by repeatedly adding the same colored ball based on previous random choices. We discover that the
Externí odkaz:
https://doaj.org/article/73f6a3f94fc24008a79036e4f71ec429
We consider a new type of asymmetric rendezvous search problem in which player II needs to give player I a ‘gift’ which can be in the form of information or material. The gift can either be transfered upon meeting, as in traditional rendezvous, o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1cb45d909ddb872f31250b6fb5b18854
http://wrap.warwick.ac.uk/152722/7/WRAP-search-rescue-rendezvous-Alpern-2021.pdf
http://wrap.warwick.ac.uk/152722/7/WRAP-search-rescue-rendezvous-Alpern-2021.pdf
Publikováno v:
Theoretical Computer Science. 807:234-244
In this paper, we show that every Schnyder drawing is a greedy embedding. Schnyder drawings are used to represent planar (maximal) graphs. It is a way of getting coordinates in R 2 given a graph G = ( V , E ) such that the representation is planar. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cbf69df4f5d9460eb2dc7ad64bb74359
https://doi.org/10.1016/j.tcs.2019.07.021
https://doi.org/10.1016/j.tcs.2019.07.021
Autor:
Pierre Leone, Steve Alpern
In this paper we solve the rendezvous problem on the line with markers that can be dropped at chosen times when the initial distance D between the players is known. In the case of one marker, the $$M_1$$ M 1 game, the marker is held by player II at t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::291b2e962038e03941198d33729fdaca
http://wrap.warwick.ac.uk/161703/7/WRAP-symbolic-programming-approach-rendezvous-search-problem-Alpern-2022.pdf
http://wrap.warwick.ac.uk/161703/7/WRAP-symbolic-programming-approach-rendezvous-search-problem-Alpern-2022.pdf
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031149252
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3b2e20963bfe1f8a8ef6d16238733fc
https://doi.org/10.1007/978-3-031-14926-9_25
https://doi.org/10.1007/978-3-031-14926-9_25
Autor:
Cristina Muñoz, Pierre Leone
Publikováno v:
Future Generation Computer Systems, Vol. 75 (2017) pp. 108-127
In this research, we propose the construction of a new architecture of Fragmented-Iterated Bloom Filters to redirect events of a distributed event-based system. We introduce two novel structures of Bloom Filters: Fragmented Bloom Filters and Iterated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09c086fb94a2c1ef329f30d8bfa9fe69
https://doi.org/10.1016/j.future.2017.02.021
https://doi.org/10.1016/j.future.2017.02.021
Autor:
Pierre Leone, Kasun Samarasinghe
Publikováno v:
Mission-Oriented Sensor Networks and Systems: Art and Science. Volume 1: Foundations pp. 603-634
Mission-Oriented Sensor Networks and Systems: Art and Science ISBN: 9783319911458
Mission-Oriented Sensor Networks and Systems: Art and Science. Volume 1: Foundations
Mission-Oriented Sensor Networks and Systems: Art and Science ISBN: 9783319911458
Mission-Oriented Sensor Networks and Systems: Art and Science. Volume 1: Foundations
Geometric routing is a routing scheme proposed for networks with highly dynamic topology, like wireless ad hoc networks. It uses the geometric coordinates of the nodes and makes routing decisions based on the geometric properties between them. Hence,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb4dae0fb3103457b68ffb3428b56f6c
https://archive-ouverte.unige.ch/unige:135655
https://archive-ouverte.unige.ch/unige:135655
Autor:
Kevine Johane Jumeta Dongmo, Mariscal Brice Tchatat Tali, Yannick Stéphane Fotsing Fongang, Pierre Leonel K. Tafokeu Taguimjeu, Donald Ulrich Kenou Kagho, Gabin Thierry Bitchagno, Bruno Ndjakou Lenta, Fabrice Fekam Boyom, Norbert Sewald, Silvère Augustin Ngouela
Publikováno v:
BMC Complementary Medicine and Therapies, Vol 23, Iss 1, Pp 1-13 (2023)
Abstract Background Dacryodes edulis is a plant that belongs to the Burseraceae family. It is widely used traditionally alone or in association with other plants in Cameroonian folk medicine to cure wounds, fever, headaches, and malaria. The aim of t
Externí odkaz:
https://doaj.org/article/f8bccf5953564d7193faa83849e0b462