Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Vianney Kengne Tchendji"'
Autor:
Achile Leonel Nguemkam, Ahmed Hemida Anwar, Vianney Kengne Tchendji, Deepak K. Tosh, Charles Kamhoua
Publikováno v:
IEEE Access, Vol 12, Pp 187444-187455 (2024)
This paper presents a scalable solution for zero-sum, one-sided, partially observable stochastic games (Z-POSGs) in the realm of cybersecurity. Existing heuristic search value iteration (HSVI) methods often face significant challenges with scalabilit
Externí odkaz:
https://doaj.org/article/c18fdf3ad3da4b6ea88bd2cf2ac726a3
Publikováno v:
Journal of Information and Telecommunication, Vol 7, Iss 1, Pp 1-28 (2023)
ABSTRACTThis paper deals with resource allocation challenge focusing on Infrastructure Providers (InPs) and Service Providers (SPs) in virtual network environments. In such environments, resources (storage space, bandwidth, CPU, …) can be reallocat
Externí odkaz:
https://doaj.org/article/28101662bf2445eba81f10307418c45f
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:
Journal of Computer Networks and Communications, Vol 2020 (2020)
Virtual networks are sets of virtual devices that are interconnected through a physical network to provide services to end users. These services are usually heterogeneous (VOIP, VoD, streaming, etc.), exploit various amounts of resources (bandwidth,
Externí odkaz:
https://doaj.org/article/70dd572c4afa44cbb01bcdb9372f5922
Publikováno v:
Journal of Internet Services and Applications, Vol 9, Iss 1, Pp 1-15 (2018)
Abstract The weaknesses of the Internet led to the creation of a new network paradigm – network virtualization. Virtualization is a very successful technique for sharing and reusing resources, which results in higher efficiency. Despite its advanta
Externí odkaz:
https://doaj.org/article/456294f9b2c94c828a4858db41fbca4c
Publikováno v:
Journal of Information and Telecommunication. 7:1-28
Publikováno v:
SSRN Electronic Journal.
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
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
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