21 citations · 32 across the 4 of their papers we have counts for
6 papers
A Comparison of Random Task Graph Generation Methods for Scheduling Problems
Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
How to generate instances with relevant properties and without bias remains an open problem of critical importance for a fair comparison of heuristics. In the context of scheduling…
An Approximation-based Approach for the Random Exploration of Large Models
Julien Bernard, Pierre-Cyrille Héam, Olga Kouchnarenko
System modeling is a classical approach to ensure their reliability since it is suitable both for a formal verification and for software testing techniques. In the context of model…
A Markov Chain Monte Carlo Approach to Cost Matrix Generation for Scheduling Performance Evaluation
Louis-Claude Canon, Mohamad El Sayah, Pierre-Cyrille Héam
In high performance computing, scheduling of tasks and allocation to machines is very critical especially when we are dealing with heterogeneous execution costs. Simulations can be…
A Cryptographic Approach for Steganography
Jacques M. Bahi, Christophe Guyeux, Pierre-Cyrille Heam
In this research work, security concepts are formalized in steganography, and the common paradigms based on information theory are replaced by another ones inspired from cryptograp…
Traversing a n-cube without Balanced Hamiltonian Cycle to Generate Pseudorandom Numbers
Jean-François Couchot, Pierre-Cyrille Heam, Christophe Guyeux +2
This article presents a new class of Pseudorandom Number Generators. The generators are based on traversing a n-cube where a Balanced Hamiltonian Cycle has been removed. The constr…
Random Walk in a N-cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations
Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux +1
Designing a pseudorandom number generator (PRNG) is a difficult and complex task. Many recent works have considered chaotic functions as the basis of built PRNGs: the quality of th…