Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Ahmed Mouhamadou Wade"'
Publikováno v:
World Journal of Advanced Research and Reviews. 13:095-107
Road traffic accidents (RTAs) are a global burden that particularly affects people in developing countries. According to the World Health Organization, having reliable and precise data is necessary to raise the alert on the scale of road accidents an
Autor:
Ahmed Mouhamadou Wade
Publikováno v:
International Journal of Advanced Research. 9:315-319
In this paper, we study the necessary and sufficient time to explore with return constantly connected dynamic networks modelled by a dynamic graphs. Exploration with return consists, for an agent operating in a dynamic graph, of visiting all the vert
Autor:
David Ilcinkas, Ahmed Mouhamadou Wade
Publikováno v:
Theory of Computing Systems
Theory of Computing Systems, Springer Verlag, 2021, 65, pp.257-273. ⟨10.1007/s00224-020-10001-0⟩
Theory of Computing Systems, Springer Verlag, 2021, 65, pp.257-273. ⟨10.1007/s00224-020-10001-0⟩
We study the problem of exploration by a mobile entity (agent) of a class of dynamic networks, namely constantly connected dynamic graphs. This problem has already been studied in the case where the agent knows the dynamics of the graph and the under
Autor:
Ahmed Mouhamadou Wade
In this paper, we study the necessary and sufficient time to explore constantly connected dynamics graphs by a mobile entity (agent). A dynamic graph is constantly connected if for each time units, there exists a stable connected spanning tree [10].
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b90f528d7c4240f842f18e426dd4013f
Autor:
David Ilcinkas, Ahmed Mouhamadou Wade
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2020, 841, pp.50-61. ⟨10.1016/j.tcs.2020.07.003⟩
Theoretical Computer Science, Elsevier, 2020, 841, pp.50-61. ⟨10.1016/j.tcs.2020.07.003⟩
We study the problem of exploration by a mobile entity (agent) of a class of highly dynamic networks, namely the carrier graphs (the C-graphs, modeling public transportation systems, among others). These are defined by a set of carriers following inf
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::507bfdfaf3a9da7a1c26f9887a5af007
https://hal.archives-ouvertes.fr/hal-02909252/document
https://hal.archives-ouvertes.fr/hal-02909252/document
Publikováno v:
Ad Hoc Networks
Ad Hoc Networks, Elsevier, 2016, 50, pp.13-22. ⟨10.1016/j.adhoc.2016.05.004⟩
Ad Hoc Networks, 2016, 50, pp.13-22. ⟨10.1016/j.adhoc.2016.05.004⟩
Ad Hoc Networks, Elsevier, 2016, 50, pp.13-22. ⟨10.1016/j.adhoc.2016.05.004⟩
Ad Hoc Networks, 2016, 50, pp.13-22. ⟨10.1016/j.adhoc.2016.05.004⟩
International audience; The dynamics of a mobile dynamic distributed system depends on both the node mobility and the capacity of the underlying communication protocol. To qualify the dynamics of a distributed system, the family of dynamic p-graphs i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de2d4d9dd1825fb7e41de8fb83849e47
https://hal.archives-ouvertes.fr/hal-01322760
https://hal.archives-ouvertes.fr/hal-01322760
Publikováno v:
Structural Information and Communication Complexity ISBN: 9783319096193
SIROCCO
21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014)
21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Jul 2014, Hida Takayama, Japan. pp.250--262, ⟨10.1007/978-3-319-09620-9_20⟩
SIROCCO
21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014)
21th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2014), Jul 2014, Hida Takayama, Japan. pp.250--262, ⟨10.1007/978-3-319-09620-9_20⟩
International audience; We study the problem of exploration by a mobile entity (agent) of a class of dynamic networks, namely constantly connected dynamic graphs. This problem has already been studied in the case where the agent knows the dynamics of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d42812fdf423fc7988d2240522df5c56
https://doi.org/10.1007/978-3-319-09620-9_20
https://doi.org/10.1007/978-3-319-09620-9_20
Autor:
David Ilcinkas, Ahmed Mouhamadou Wade
Publikováno v:
Proceedings of the 20th International Colloquium on Structural Information and Communication Complexity
SIROCCO 2013
SIROCCO 2013, Jul 2013, Ischia, Italy
Structural Information and Communication Complexity ISBN: 9783319035772
SIROCCO
Theory of Computing Systems
Theory of Computing Systems, Springer Verlag, 2018, 62 (5), pp.1144-1160. ⟨10.1007/s00224-017-9796-3⟩
SIROCCO 2013
SIROCCO 2013, Jul 2013, Ischia, Italy
Structural Information and Communication Complexity ISBN: 9783319035772
SIROCCO
Theory of Computing Systems
Theory of Computing Systems, Springer Verlag, 2018, 62 (5), pp.1144-1160. ⟨10.1007/s00224-017-9796-3⟩
In this paper, we study the T-interval-connected dynamic graphs from the point of view of the time necessary and sufficient for their exploration by a mobile entity (agent). A dynamic graph (more precisely, an evolving graph) is T-interval-connected
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f41cc85ff2388c01f9c08fff52178b44
https://hal.archives-ouvertes.fr/hal-00847771/file/final_SIROCCO2013.pdf
https://hal.archives-ouvertes.fr/hal-00847771/file/final_SIROCCO2013.pdf
Autor:
Ahmed Mouhamadou Wade, David Ilcinkas
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642258725
OPODIS
Proceedings of the 15th International Conference On Principles Of Distributed Systems
OPODIS 2011
OPODIS 2011, Dec 2011, Toulouse, France. pp.451-464, ⟨10.1007/978-3-642-25873-2_31⟩
OPODIS
Proceedings of the 15th International Conference On Principles Of Distributed Systems
OPODIS 2011
OPODIS 2011, Dec 2011, Toulouse, France. pp.451-464, ⟨10.1007/978-3-642-25873-2_31⟩
International audience; We study the problem of exploration by a mobile entity (agent) of a class of dynamic networks, namely the periodically-varying graphs (the PV-graphs, modeling public transportation systems, among others). These are defined by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc1a5ba3d3df168b0c43a8c84910e5cd
https://doi.org/10.1007/978-3-642-25873-2_31
https://doi.org/10.1007/978-3-642-25873-2_31