Clémentin Tayou Djamégni

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

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

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...