Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Mohammed Mahseur"'
Publikováno v:
International Journal of Applied Evolutionary Computation. 11:28-46
The graph coloring problem (GCP) is a well-known classical combinatorial optimization problem in graph theory. It is known to be an NP-Hard problem, so many heuristic algorithms have been employed to solve this problem. This article proposes a modifi
Publikováno v:
International Journal of Swarm Intelligence Research. 10:23-45
The graph coloring problem (GCP) is one of the most interesting classical combinatorial optimization problems in graph theory. It is known to be an NP-Hard problem, so many heuristic algorithms have been employed to solve this problem. In this articl
Autor:
Mohammed Mahseur, Abdelmadjid Boukra
Publikováno v:
International Journal of Applied Metaheuristic Computing. 10:27-54
Optimizing the QoS of multicast routing with multiple constraints is a NP-hard problem. Thus, the use of approximate methods is unavoidable. This article proposes to modify Bat Algorithm (BA) to solve such problem. BA is a metaheuristic that has been
Publikováno v:
International Journal of Applied Evolutionary Computation. 9:22-36
Multicast routing is the problem of finding the spanning tree of a set of destinations whose roots are the source node and its leaves are the set of destination nodes by optimizing a set of quality of service parameters and satisfying a set of transm
Publikováno v:
Neural Computing and Applications
Neural Computing and Applications, Springer Verlag, 2020, 32 (21), pp.16625-16646. ⟨10.1007/s00521-020-04866-y⟩
Neural Computing and Applications, Springer Verlag, 2020, 32 (21), pp.16625-16646. ⟨10.1007/s00521-020-04866-y⟩
International audience; Dragonfly algorithm (DA) is a novel swarm intelligence meta-heuristic optimization algorithm inspired by the dynamic and static swarming behaviors of artificial dragonflies in nature. It has proved its effectiveness and superi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3ae048cf4715a26e08fe4a1cad79f9d
https://hal.archives-ouvertes.fr/hal-03032280
https://hal.archives-ouvertes.fr/hal-03032280
Publikováno v:
Modelling and Implementation of Complex Systems ISBN: 9783030054809
Optimizing the quality of service in a multicast routing is a persistent research problem for data transmission in computer networks. It is known to be an NP-hard problem, so several meta-heuristics are applied for an approximate resolution. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::08643fadfe1c29131d6e30c3873b545d
https://doi.org/10.1007/978-3-030-05481-6_4
https://doi.org/10.1007/978-3-030-05481-6_4
Publikováno v:
Modelling and Implementation of Complex Systems ISBN: 9783030054809
This paper proposes a new Chaotic Binary Salp Swarm Algorithm (CBSSA) to solve the graph coloring problem. First, the Binary Salp Swarm Algorithm (BSSA) is obtained from the original Salp Swarm Algorithm (SSA) using the S-Shaped transfer function (Si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e1edc60f8af6f8869c255c8b702aa75
https://doi.org/10.1007/978-3-030-05481-6_8
https://doi.org/10.1007/978-3-030-05481-6_8
Publikováno v:
IFIP Advances in Information and Communication Technology
6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA)
6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA), May 2018, Oran, Algeria. pp.128-139, ⟨10.1007/978-3-319-89743-1_12⟩
Computational Intelligence and Its Applications ISBN: 9783319897424
CIIA
6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA)
6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA), May 2018, Oran, Algeria. pp.128-139, ⟨10.1007/978-3-319-89743-1_12⟩
Computational Intelligence and Its Applications ISBN: 9783319897424
CIIA
Part 2: Evolutionary Computation; International audience; In recent years, we are witnessing the spread of many and various modern real-time applications implemented on computer networks such as video conferencing, distance education, online games, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c16bfa123d7652ae6f61cdb1daa2b2b
https://hal.inria.fr/hal-01913908
https://hal.inria.fr/hal-01913908
Publikováno v:
2017 5th International Conference on Electrical Engineering - Boumerdes (ICEE-B).
The quality of service multicast routing problem (QoSMRP) is a very interesting research issue for transmission in communication networks. It is known to be an NP-hard problem, so many heuristic algorithms have been employed for solving this problem.
Publikováno v:
International Journal of Communication Networks and Distributed Systems. 22:329
The QoS multicast routing problem is one of the most interesting combinatorial optimisation problems for transmission in the areas of networks and distributed systems. It is known to be an NP-hard problem, so many heuristic algorithms have been emplo