Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Jerry Lacmou Zeutouo"'
Publikováno v:
Data Science and Engineering, Vol 4, Iss 2, Pp 141-156 (2019)
Abstract The coarse-grained multicomputer parallel model (CGM for short) has been used for solving several classes of dynamic programming problems. In this paper, we propose a parallel algorithm on the CGM model, with p processors, for solving the op
Externí odkaz:
https://doaj.org/article/6d1523546ac34e67ad0fc77a8da7ce84
Publikováno v:
The Journal of Supercomputing. 78:5306-5332
Minimum cost parenthesizing problem (MPP for short) is a well-known example of the polyadic-nonserial dynamic-programming problem. This paper presents two efficient parallel algorithms on the coarse-grained multicomputer model for solving the MPP. By
Autor:
Vianney Kengne Tchendji, Franklin Ingrid Kamga Youmbi, Clementin Tayou Djamegni, Jerry Lacmou Zeutouo
Publikováno v:
IEEE/ACM transactions on computational biology and bioinformatics.
To enable extensive research on the ribonucleic acid (RNA) molecule, predicting its spatial structure stands as a much-valued research field. In this regard, Nussinov and Jacobson published the (now) de facto solution to predict the halfway secondary
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce37d9896371248072c21598d6b789dd
http://arxiv.org/abs/2207.06083
http://arxiv.org/abs/2207.06083
Publikováno v:
Data Science and Engineering, Vol 4, Iss 2, Pp 141-156 (2019)
The coarse-grained multicomputer parallel model (CGM for short) has been used for solving several classes of dynamic programming problems. In this paper, we propose a parallel algorithm on the CGM model, with p processors, for solving the optimal bin
Autor:
Vianney Kengne Tchendji, Hermann Bogning Tepiele, Mathias Akong Onabid, Jean Frédéric Myoupo, Jerry Lacmou Zeutouo
Publikováno v:
Parallel Computing. 111:102927
Publikováno v:
Concurrency and Computation: Practice and Experience
Concurrency and Computation: Practice and Experience, Wiley, 2021, ⟨10.1002/cpe.6445⟩
Concurrency and Computation: Practice and Experience, Wiley, 2021, ⟨10.1002/cpe.6445⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d27d3f411c9ffceee819acd95abaf732
https://hal.archives-ouvertes.fr/hal-03266613
https://hal.archives-ouvertes.fr/hal-03266613
Publikováno v:
Parallel Computing
Parallel Computing, Elsevier, 2020, 91, pp.102598. ⟨10.1016/j.parco.2019.102598⟩
Parallel Computing, Elsevier, 2020, 91, pp.102598. ⟨10.1016/j.parco.2019.102598⟩
A variant of the Longest Common Subsequence (LCS) problem is the LCS problem with multiple substring-exclusion constraints (M-STR-EC-LCS), which has great importance in many fields especially in bioinformatics. This problem consists to compute the LC
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7bfbbdbcc6f66a9c1775c0db9ac339cf
https://hal.archives-ouvertes.fr/hal-03236493
https://hal.archives-ouvertes.fr/hal-03236493