Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Jamal Mouline"'
Publikováno v:
Computational and Mathematical Methods, Vol 2023 (2023)
In this paper, we present an innovative approach for the discovery of involutory maximum distance separable (MDS) matrices over finite fields F2q, derived from MDS self-dual codes, by employing a technique based on genetic algorithms. The significanc
Externí odkaz:
https://doaj.org/article/d1702487f931425ba9cf54c43b372d64
Autor:
Youness El Kouch, Jamal Mouline
Publikováno v:
Abstract and Applied Analysis, Vol 2022 (2022)
In this paper, we consider a JS metric space endowed with convexity structure, which will allow us to examine and study convergence of Mann iteration and Ishikawa iteration for Banach type and Chatterjea type contractions defined on JS metric space.
Externí odkaz:
https://doaj.org/article/91cea49d20a847e2a1eb8899e4425151
Publikováno v:
Axioms, Vol 10, Iss 2, p 72 (2021)
In this paper, we introduce four new types of contractions called in this order Kanan-S-type tricyclic contraction, Chattergea-S-type tricyclic contraction, Riech-S-type tricyclic contraction, Cirić-S-type tricyclic contraction, and we prove the exi
Externí odkaz:
https://doaj.org/article/7d749ad76a874d36b1de7f722e794e9c
Publikováno v:
Journal of Hunan University Natural Sciences. 49:205-211
Many research papers in coding theory have recently focused on designing high-rate codes or improving codes that exist through a better understanding and then improving the coding and decoding algorithm. As a result, this paper aims to investigate th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9a06221d48cd137e05c9bd2c2fa61a8
https://doi.org/10.55463/issn.1674-2974.49.1.26
https://doi.org/10.55463/issn.1674-2974.49.1.26
Autor:
El Mehdi Bellfkih, Said Nouh, Imrane Chemseddine Idrissi, Abdelaziz Ettaoufik, Khalid Louartiti, Jamal Mouline
The genetic algorithm (GA) is an adaptive metaheuristic search method based on the process of evolution and natural selection theory. It is an efficient algorithm used for solving the combinatorial optimization problems, e.g., travel salesman problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc8985ac63295f6518d47b8b99d035d8
https://zenodo.org/record/7127710
https://zenodo.org/record/7127710
Publikováno v:
Axioms, Vol 10, Iss 72, p 72 (2021)
Axioms; Volume 10; Issue 2; Pages: 72
Axioms; Volume 10; Issue 2; Pages: 72
In this paper, we introduce four new types of contractions called in this order Kanan-S-type tricyclic contraction, Chattergea-S-type tricyclic contraction, Riech-S-type tricyclic contraction, Cirić-S-type tricyclic contraction, and we prove the exi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f79f3a06e31075496684bfd18e303df
https://www.mdpi.com/2075-1680/10/2/72
https://www.mdpi.com/2075-1680/10/2/72