Clémentin Tayou Djamégni

Orcid: 0000-0002-2231-3281

According to our database1, Clémentin Tayou Djamégni authored at least 39 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
GaTeBaSep: game theory-based security protocol against ARP spoofing attacks in software-defined networks.
Int. J. Inf. Sec., February, 2024

2023
A data security and privacy scheme for user quality of experience in a Mobile Edge Computing-based network.
Array, September, 2023

P-FARFAR2: A multithreaded greedy approach to sampling low-energy RNA structures in Rosetta FARFAR2.
Comput. Biol. Chem., June, 2023

A novel algorithm for mining maximal frequent gradual patterns.
Eng. Appl. Artif. Intell., April, 2023

MultiHop optimal time complexity clustering for emerging IoT applications.
Clust. Comput., April, 2023

A Parallel Tiled and Sparsified Four-Russians Algorithm for Nussinov's RNA Folding.
IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Using Machine Learning Techniques for Rainfall Estimation Based on Microwave Links of Mobile Telecommunication Networks.
SN Comput. Sci., 2023

A Method of Plant Disease Detection Analysis From Image Object Extraction Based on the Mask R-CNN Model.
Proceedings of the IEEE International Symposium on Technology and Society, 2023

Horizontally Elastic Edge Finder Rule for Cumulative Constraint Based on Slack and Density.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

2022
Horizontally Elastic Edge-Finder Algorithm for Cumulative Resource Constraint Revisited.
Oper. Res. Forum, November, 2022

A Machine Learning Approach for the Classification of Wet and Dry Periods Using Commercial Microwave Link Data.
SN Comput. Sci., 2022

A projection-stable grammatical model for the distributed execution of administrative processes with emphasis on actors' views.
J. King Saud Univ. Comput. Inf. Sci., 2022

Energy-efficient workflow scheduling based on workflow structures under deadline and budget constraints in the cloud.
CoRR, 2022

Efficient mining of intra-periodic frequent sequences.
Array, 2022

2021
E2BaSeP: Efficient Bayes Based Security Protocol Against ARP Spoofing Attacks in SDN Architectures.
J. Hardw. Syst. Secur., 2021

Dynamic provisioning with structure inspired selection and limitation of VMs based cost-time efficient workflow scheduling in the cloud.
Clust. Comput., 2021

2020
Cost-time trade-off efficient workflow scheduling in cloud.
Simul. Model. Pract. Theory, 2020

A Language and Methodology based on Scenarios, Grammars and Views, for Administrative Business Processes Modelling.
CoRR, 2020

On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers.
Constraints An Int. J., 2020

Amélioration du raisonnement dans les solveurs SAT CDCL avec la règle d'extension.
ARIMA J., 2020

Parallel Hybridization for SAT: An Efficient Combination of Search Space Splitting and Portfolio.
ARIMA J., 2020

A Multi Ant Colony Optimization Approach For The Traveling Salesman Problem.
ARIMA J., 2020

A Language for the Specification of Administrative Workflow Processes with Emphasis on Actors' Views.
Proceedings of the Computational Science and Its Applications - ICCSA 2020, 2020

A Grammatical Model for the Specification of Administrative Workflow Using Scenario as Modelling Unit.
Proceedings of the Applied Informatics - Third International Conference, 2020

2019
Enhancing Static Symmetry Breaking with Dynamic Symmetry Handling in CDCL SAT Solvers.
Int. J. Artif. Intell. Tools, 2019

2018
ISCP: An Instantaneous and Secure Clustering Protocol for Wireless Sensor Networks.
Netw. Protoc. Algorithms, 2018

2016
Grid's Acquaintance-Based Multiagent Model of Distributed Meta-Scheduling.
Proceedings of the 12th International Conference on Signal-Image Technology & Internet-Based Systems, 2016

2014
Résolution étendue par substitution dynamique des fonctions booléennes.
Rev. d'Intelligence Artif., 2014

2009
A reindexing based approach towards mapping of DAG with affine schedules onto parallel embedded systems.
J. Parallel Distributed Comput., 2009

2007
Parallel Computation of Closed Itemsets and Implication Rule Bases.
Proceedings of the Parallel and Distributed Processing and Applications, 2007

2006
Complexity of matrix product on modular linear systolic arrays for algorithms with affine schedules.
J. Parallel Distributed Comput., 2006

Exécution d'un graphe cubique de tâches sur un réseau bi-dimensionnel et asymptotiquement optimal.
ARIMA J., 2006

2005
A Parallel Algorithm for Lattice Construction.
Proceedings of the Formal Concept Analysis, Third International Conference, 2005

2004
Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays.
J. Parallel Distributed Comput., 2004

2002
Synthesis Of Space-Time Optimal Systolic Algorithms For The Cholesky Factorization.
Discret. Math. Theor. Comput. Sci., 2002

2000
A New Algorithm for Dynamic Programming on Regular Arrays.
Parallel Process. Lett., 2000

Derivation of systolic algorithms for the algebraic path problem by recurrence transformations.
Parallel Comput., 2000

1997
A Cost-Optimal Pipeline Algorithm for Permutation Generation in Lexicographic Order.
J. Parallel Distributed Comput., 1997

1996
Scheduling of the DAG Associated with Pipeline Inversion of Triangular Matrices.
Parallel Process. Lett., 1996


  Loading...