Zobrazeno 1 - 10
of 191
pro vyhledávání: '"Bouhlel, Mohamed"'
Publikováno v:
In Scientia Horticulturae 1 December 2023 322
The amount of audio-visual information has increased dramatically with the advent of High Speed Internet. Furthermore, technological advances in recent years in the field of information technology, have simplified the use of video data in various fie
Externí odkaz:
http://arxiv.org/abs/1904.10715
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bouhlel, Mohamed Amine
Les turbomachines aéronautiques sont composées de plusieurs roues aubagées dont la fonction estde transférer l’énergie de l’air au rotor. Les roues aubagées des modules compresseur et turbine sontdes pièces particulièrement sensibles car
Externí odkaz:
http://www.theses.fr/2016ESAE0002/document
Surrogate models provide a low computational cost alternative to evaluating expensive functions. The construction of accurate surrogate models with large numbers of independent variables is currently prohibitive because it requires a large number of
Externí odkaz:
http://arxiv.org/abs/1708.02663
Autor:
Bouhlel, Mohamed
Les matériaux cimentaires sont utilisés de plus en plus dans le domaine de la construction civile. Plusieurs recherches expérimentales sont réalisées dans le but de mieux comprendre les mécanismes pilotant le comportement des bétons et d’ide
Externí odkaz:
http://www.theses.ulaval.ca/2012/28635/28635.pdf
Autor:
Mansouri, Ali, Bouhlel, Mohamed Salim
Several authors modelled networks ad hoc by oriented or disoriented graphs, whereby the problem of allowance (allocation) of the frequencies at the level of the network was transformed into coloring problem of nodes in the graph. Graph coloring is a
Externí odkaz:
http://arxiv.org/abs/1406.1329
Autor:
Mansouri, Ali, Bouhlel, Mohamed Salim
Publikováno v:
International Journal of Computer Science & Information Technology (IJCSIT) Vol 6, No 1, February 2014
A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj . A coloring is a Grundy coloring if ever
Externí odkaz:
http://arxiv.org/abs/1406.0196
Autor:
Mansouri, Ali, bouhlel, Mohamed Salim
Publikováno v:
SETIT 2009 5th International Conference: Sciences of Electronic, Technologies of Information and T'elecommunications March 22 26 2009 TUNISIA
The problem of the data routing management, it provides a method or a strategy that guarantees at any time the connection between any pair of nodes in the network. This routing method must be able to cope with frequent changes in the topology and als
Externí odkaz:
http://arxiv.org/abs/1405.7383
Autor:
Mansouri, Ali, Bouhlel, Mohamed Salim
The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex x colored with color i, is adjacent to (i - 1) vertices colored with each color j, In this paper we giv
Externí odkaz:
http://arxiv.org/abs/1405.6432