Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Mohamed, Hanene"'
Autor:
Fricker, Christine, Mohamed, Hanene
The problem of reservation in a large distributed system is analyzed via a new mathematical model. A typical application is a station-based car-sharing system which can be described as a closed stochastic network where the nodes are the stations and
Externí odkaz:
http://arxiv.org/abs/2201.08298
Autor:
Aguech, Rafik1 (AUTHOR) raguech@ksu.edu.sa, Mohamed, Hanene2 (AUTHOR) hanene.mohamed@parisnanterre.fr
Publikováno v:
Mathematics (2227-7390). Dec2023, Vol. 11 Issue 24, p4967. 13p.
Autor:
Mohamed, Hanene
Cette thèse est dédiée à l'étude d'une large classe d'algorithmes, appelés algorithmes en arbre. En utilisant une représentation probabiliste appropriée, le comportement asymptotique de tels algorithmes est analysé. L'approche unifie les ét
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00270742
http://tel.archives-ouvertes.fr/docs/00/27/07/42/PDF/THESE.pdf
http://tel.archives-ouvertes.fr/docs/00/27/07/42/PDF/THESE.pdf
This paper deals with the problem of identifying elephants in the Internet Traffic. The aim is to analyze a new adaptive algorithm based on a Bloom Filter. This algorithm uses a so-called min-rule which can be described as in the supermarket model. T
Externí odkaz:
http://arxiv.org/abs/0903.2134
Autor:
Mohamed, Hanène, Robert, Philippe
Publikováno v:
Annals of Applied Probability 2010, Vol. 20, No. 1, 26-51
In this paper, a general tree algorithm processing a random flow of arrivals is analyzed. Capetanakis--Tsybakov--Mikhailov's protocol in the context of communication networks with random access is an example of such an algorithm. In computer science,
Externí odkaz:
http://arxiv.org/abs/0809.3577
Autor:
Mohamed, Hanene
Publikováno v:
Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (2006) 225-236
A {\em leader election} algorithm is an elimination process that divides recursively into tow subgroups an initial group of n items, eliminates one subgroup and continues the procedure until a subgroup is of size 1. In this paper the biased case is a
Externí odkaz:
http://arxiv.org/abs/cs/0702056
Autor:
Mohamed, Hanène, Robert, Philippe
Publikováno v:
Annals of Applied Probability 2005, Vol. 15, No. 4, 2445-2471
In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resor
Externí odkaz:
http://arxiv.org/abs/math/0412188
Free-floating has an increasing popularity in carsharing but imbalance problem shows the need of stochastic modelling and analysis. In this paper, a new stochastic model suited to free-floating is proposed, taking into account the sharing of public s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f57917aa04694c8bef9a9abd01400c30
https://hal.science/hal-03938964/file/Hal_WCRT_2023.pdf
https://hal.science/hal-03938964/file/Hal_WCRT_2023.pdf
The problem of reservation in a large distributed system is analyzed via a new mathematical model. A typical application is a station-based car-sharing system which can be described as a closed stochastic network where the nodes are the stations and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::68ff7afdb7808f247a6464934f6a8c74
https://hal.science/hal-03539104/document
https://hal.science/hal-03539104/document
Autor:
Mohamed, Hanène, Robert, Philippe
Publikováno v:
The Annals of Applied Probability, 2010 Feb 01. 20(1), 26-51.
Externí odkaz:
https://www.jstor.org/stable/25662549