Zobrazeno 1 - 10
of 218
pro vyhledávání: '"Hanafi, Said"'
Publikováno v:
In European Journal of Operational Research 1 August 2024 316(3):873-886
Clustering consists of partitioning data objects into subsets called clusters according to some similarity criteria. This paper addresses a generalization called quasi-clustering that allows overlapping of clusters, and which we link to biclustering.
Externí odkaz:
http://arxiv.org/abs/2002.04711
Publikováno v:
In Applied Soft Computing December 2022 131
Publikováno v:
In Discrete Applied Mathematics 15 February 2022 308:235-254
Publikováno v:
In Information Sciences October 2020 538:444-466
Autor:
Gelareh, Shahin, Glover, Fred, Guemri, Oualid, Hanafi, Saïd, Nduwayo, Placide, Todosijević, Raca
Publikováno v:
In Omega March 2020 91
In railway operations, a timetable is established to determine the departure and arrival times for the trains or other rolling stock at the different stations or relevant points inside the rail network or a subset of this network. The elaboration of
Externí odkaz:
http://arxiv.org/abs/1411.6998
Autor:
Rebai, Ahmed Riadh, Hanafi, Said
Publikováno v:
International Journal of Computer Networks & Communications (IJCNC) Vol.3, No.2, March 2011
In this paper we expose a dynamic traffic-classification scheme to support multimedia applications such as voice and broadband video transmissions over IEEE 802.11 Wireless Local Area Networks (WLANs). Obviously, over a Wi-Fi link and to better serve
Externí odkaz:
http://arxiv.org/abs/1103.3340
Autor:
Rebai, Ahmed Riadh, Hanafi, Saïd
Publikováno v:
International Journal of Wireless & Mobile Networks (IJWMN) Vol. 3, No. 1, February 2011
Previous studies have shown that the actual handoff schemes employed in the IEEE 802.11 Wireless LANs (WLANs) do not meet the strict delay constraints placed by many multimedia applications like Voice over IP. Both the active and the passive supporte
Externí odkaz:
http://arxiv.org/abs/1102.5189
Publikováno v:
VI ALIO/EURO Workshop on Applied Combinatorial Optimization, Buenos Aires : Argentine (2008)
We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove large?scale strong correlated instances. The optimal values of the 10
Externí odkaz:
http://arxiv.org/abs/0905.0848