Zobrazeno 1 - 10
of 114
pro vyhledávání: '"Hanusse, Nicolas"'
The Freeze-Tag Problem, introduced in Arkin et al. (SODA'02) consists of waking up a swarm of $n$ robots, starting from a single active robot. In the basic geometric version, every robot is given coordinates in the plane. As soon as a robot is awaken
Externí odkaz:
http://arxiv.org/abs/2402.03258
Autor:
Hanusse, Nicolas
L'idée directrice de ce travail est de montrer que bon nombre de requêtes peuvent être exprimées comme une navigation dans des graphes.
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00717765
http://tel.archives-ouvertes.fr/docs/00/71/77/65/PDF/HDR-NicolasHanusse09.pdf
http://tel.archives-ouvertes.fr/docs/00/71/77/65/PDF/HDR-NicolasHanusse09.pdf
Publikováno v:
In Information Systems February 2020 88
In this paper we determine the stretch factor of the $L_1$-Delaunay and $L_\infty$-Delaunay triangulations, and we show that this stretch is $\sqrt{4+2\sqrt{2}} \approx 2.61$. Between any two points $x,y$ of such triangulations, we construct a path w
Externí odkaz:
http://arxiv.org/abs/1202.5127
Publikováno v:
In Theoretical Computer Science 9 May 2016 627:1-12
Publikováno v:
In Computational Geometry: Theory and Applications March 2015 48(3):237-250
Les réseaux de capteurs sont un véritable atout pour réduire la consommation d'énergie et l'empreinte carbonedes universités. En effet, ces derniers sont particulièrement appropriés pour superviser la consommation et les activités d’un bât
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______166::764217a8e79ecc70d0a995b6ada00380
https://hal.archives-ouvertes.fr/hal-03593064
https://hal.archives-ouvertes.fr/hal-03593064
Publikováno v:
In Theoretical Computer Science 2008 402(2):190-198
Publikováno v:
20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020)
20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020), Sep 2020, Pisa (virtual), Italy. pp.11:1-11:19, ⟨10.4230/OASIcs.ATMOS.2020.11⟩
20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020), Sep 2020, Pisa (virtual), Italy. pp.11:1-11:19, ⟨10.4230/OASIcs.ATMOS.2020.11⟩
This paper deals with the computation of d-dimensional multicriteria shortest paths. In a weighted graph with arc weights represented by vectors, the cost of a path is the vector sum of the weights of its arcs. For a given pair consisting of a source
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::353aa03b9a2f0d475914c7e761d4f29e
https://hal.archives-ouvertes.fr/hal-03034585/file/OASIcs-ATMOS-2020-11.pdf
https://hal.archives-ouvertes.fr/hal-03034585/file/OASIcs-ATMOS-2020-11.pdf
Publikováno v:
In Information and Computation 2006 204(5):697-712