Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Sébastien Bouchard"'
Publikováno v:
ACM Transactions on Algorithms. 19:1-32
A mobile agent navigating along edges of a simple connected unweighted graph, either finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task is known as treasure hunt. The agent has no a priori knowl
Publikováno v:
Networks
Networks, In press, pp.net.22075. ⟨10.1002/net.22075⟩
Networks, In press, pp.net.22075. ⟨10.1002/net.22075⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9d6180bc287f4f598ae5da5a89552c82
https://hal.science/hal-03595594
https://hal.science/hal-03595594
Publikováno v:
Algorithmica
Algorithmica, Springer Verlag, 2020, 82 (11), pp.3250-3281. ⟨10.1007/s00453-020-00724-4⟩
29th International Symposium on Algorithms and Computation, ISAAC 2018
29th International Symposium on Algorithms and Computation, ISAAC 2018, Dec 2018, Jiaoxi Township, Taiwan. pp.48:1--48:13, ⟨10.4230/LIPIcs.ISAAC.2018.48⟩
Algorithmica, 2020, 82 (11), pp.3250-3281. ⟨10.1007/s00453-020-00724-4⟩
Algorithmica, Springer Verlag, 2020, 82 (11), pp.3250-3281. ⟨10.1007/s00453-020-00724-4⟩
29th International Symposium on Algorithms and Computation, ISAAC 2018
29th International Symposium on Algorithms and Computation, ISAAC 2018, Dec 2018, Jiaoxi Township, Taiwan. pp.48:1--48:13, ⟨10.4230/LIPIcs.ISAAC.2018.48⟩
Algorithmica, 2020, 82 (11), pp.3250-3281. ⟨10.1007/s00453-020-00724-4⟩
A mobile agent equipped with a compass and a measure of length has to find an inert treasure in the Euclidean plane. Both the agent and the treasure are modeled as points. In the beginning, the agent is at a distance at most $$D>0$$ from the treasure
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8d6411977feac72b37b5571f20f4f73
https://hal.inria.fr/hal-03138288
https://hal.inria.fr/hal-03138288
Publikováno v:
PODC '20-39th Symposium on Principles of Distributed Computing
PODC '20-39th Symposium on Principles of Distributed Computing, Aug 2020, Salerno / Virtual, Italy. pp.253-262, ⟨10.1145/3382734.3405693⟩
PODC
[Research Report] Université de Picardie Jules Verne. 2020
PODC '20-39th Symposium on Principles of Distributed Computing, Aug 2020, Salerno / Virtual, Italy. pp.253-262, ⟨10.1145/3382734.3405693⟩
PODC
[Research Report] Université de Picardie Jules Verne. 2020
International audience; A team of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node and declare that they have all met. Agents have different labels which are positive integ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6610b2e31f15c6bde09b4decb5f4cc0e
https://hal.inria.fr/hal-03138303
https://hal.inria.fr/hal-03138303
Publikováno v:
SPAA
SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures
SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2020, Virtual Event, United States. pp.117-127, ⟨10.1145/3350755.3400283⟩
[Research Report] Université de Picardie Jules Verne. 2020
SPAA '20: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures
SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2020, Virtual Event, United States. pp.117-127, ⟨10.1145/3350755.3400283⟩
[Research Report] Université de Picardie Jules Verne. 2020
International audience; Two mobile agents represented by points freely moving in the plane and starting at two different positions, have to meet. The meeting, called rendezvous, occurs when agents are at distance at most r of each other and never mov
Publikováno v:
Information Processing Letters
Information Processing Letters, 2018, 133, pp.39-43. ⟨10.1016/j.ipl.2018.01.003⟩
Information Processing Letters, Elsevier, 2018, 133, pp.39-43. ⟨10.1016/j.ipl.2018.01.003⟩
BASE-Bielefeld Academic Search Engine
Information Processing Letters, 2018, 133, pp.39-43. ⟨10.1016/j.ipl.2018.01.003⟩
Information Processing Letters, Elsevier, 2018, 133, pp.39-43. ⟨10.1016/j.ipl.2018.01.003⟩
BASE-Bielefeld Academic Search Engine
International audience; We consider the task of rendezvous in networks modeled as undirected graphs. Two mobile agents with different labels, starting at different nodes of an anonymous graph, have to meet. This task has been considered in the litera
Publikováno v:
Journal of Water and Health. 15:353-359
The MI, Chromocult® coliform, and Compass CC chromogenic culture-based methods used to assess water quality by the detection of Escherichia coli and total coliforms were compared in terms of their specificity and sensitivity, using 16S rRNA sequenci
Publikováno v:
Journal of Water and Health. 15:239-250
The mEI, Chromocult® enterococci, and m-Enterococcus culture-based methods used to assess water quality by the detection of Enterococcus spp. were first compared in terms of sensitivity using (1) 41 different type strains of Enterococcus spp. and (2
Publikováno v:
20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications(ALGOTEL 2018)
20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications(ALGOTEL 2018), May 2018, Roscoff, France
Sébastien Bouchard
BASE-Bielefeld Academic Search Engine
20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications(ALGOTEL 2018), May 2018, Roscoff, France
Sébastien Bouchard
BASE-Bielefeld Academic Search Engine
National audience; Au moins deux agents mobiles se déplacent au sein d'un réseau, de sommet en sommet en traversant ses arêtes et doivent accomplir la tâche du rassemblement qui consiste à les réunir en un même sommet. Un adversaire choisit le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b294aad24f7538166d0ea80d8377e69d
https://hal.science/hal-01782387
https://hal.science/hal-01782387
Publikováno v:
ALGOTEL 2018-20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications
ALGOTEL 2018-20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France
BASE-Bielefeld Academic Search Engine
Sébastien Bouchard
ALGOTEL 2018-20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France
BASE-Bielefeld Academic Search Engine
Sébastien Bouchard
International audience; Nous étudions la tâche de l'approche entre deux agents mobiles ayant la même portée de vision limitée et se déplaçant de façon asynchrone dans le plan. En partant de positions initiales quelconques, cette tâche consis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a03cae9d4068474e51d8e3a5d55bf91a
https://hal.science/hal-01782388
https://hal.science/hal-01782388