Zobrazeno 1 - 10
of 90
pro vyhledávání: '"Myoupo, Jean Frédéric"'
This paper presents a parallel solution based on the coarse-grained multicomputer (CGM) model using the four-splitting technique to solve the optimal binary search tree problem. The well-known sequential algorithm of Knuth solves this problem in $\ma
Externí odkaz:
http://arxiv.org/abs/2207.06083
Autor:
Bomgni, Alain Bertrand, Jagho Mdemaya, Garrik Brel, Foko Sindjoung, Miguel Landry, Velempini, Mthulisi, Tchuenko Djoko, Celine Cabrelle, Myoupo, Jean Frederic
Publikováno v:
In Journal of Network and Computer Applications November 2024 231
Autor:
Bomgni, Alain Bertrand, Sindjoung, Miguel Landry Foko, Tchibonsou, Dhalil Kamdem, Velempini, Mthulisi, Myoupo, Jean Frédéric
Publikováno v:
In Computer Networks 4 September 2022 214
Autor:
Kengne Tchendji, Vianney, Bogning Tepiele, Hermann, Akong Onabid, Mathias, Myoupo, Jean Frédéric, Lacmou Zeutouo, Jerry
Publikováno v:
In Parallel Computing July 2022 111
Autor:
Tchendji, Vianney Kengne, Ngomade, Armel Nkonjoh, Zeutouo, Jerry Lacmou, Myoupo, Jean Frédéric
Publikováno v:
In Parallel Computing March 2020 91
Publikováno v:
Journal of Network & Systems Management; Mar2024, Vol. 32 Issue 1, p1-22, 22p
Publikováno v:
International Journal of Parallel, Emergent & Distributed Systems; Dec2022, Vol. 37 Issue 6, p659-679, 21p
Publikováno v:
Journal of Supercomputing; Mar2022, Vol. 78 Issue 4, p5306-5332, 27p
Publikováno v:
Concurrency & Computation: Practice & Experience; 12/25/2021, Vol. 33 Issue 24, p1-12, 12p
Autor:
Myoupo, Jean Frédéric, Kengne Tchendji, Vianney, Yankam, Yannick Florian, Tagne, Joël Casimir
Publikováno v:
Journal of Computer Networks & Communications; 8/24/2020, p1-14, 14p