Maël Guiraud

Intro

Bonjour, I'm Maël Guiraud, teacher researcher at CESI and membore of LINEACT laboratory. I finished in 2021 June my phD between DAVID, a laboratory of UVSQ (Université de Versailles Saint Quentin) and Nokia Bell Labs France, the research laboratory of Nokia.

My PhD subject treats about reducing latency of deterministic flows in new generation of networks by computing schedulings in order to avoid latency. (see Links and Publications).
I'm also working on various applications of artificial intelligence in smart buildings: predictive maintenance, optimising energy consumption while respecting user comfort, etc.

I use to work with Yann Strozecki, Dominique Barth, Olivier Marcé and Brice Leclerc.

Documents

Presentations

• Overview of the model and results presented in [1][3]
• Slides presented at ICT for [1]
• Poster presented at ONDM for [2]
• Slides for more details on model and results of [2]
• Summary of work on distributed queuing simulation
• Slides of my PhD defense

Curriculum Vitae

• English Version
• French Version

About

Cursus

• Since October 2021: Teacher Researcher at CESI
• September 2021 : ATER at l'UVSQ.
• June - July 2021: Research engineer from HYPHES (Collab between DAVID and DC Brain)
• April 2018 - June 2021: PhD Student Between DAVID (UVSQ) and Nokia Bell Labs France
• October 2016 - March 2018: Research ingineer for DAVID lab.
• April - September 2016: Internship at Nokia Bell Labs France and DAVID lab.

Qualifications

• 2021 : PhD in computer science by the University of Paris Saclay (UVSQ)
• 2016: Master AMIS (UVSQ)
• 2014: Licence on computer science cursus (UVSQ)

Teaching

• Data Structure and Algorithms: Licence and Master
• Graph Algorithms: Licence
• Programming (C,Java): Licence
• Operating Systems: Math Teachers
• Supervising a Licence intern

Publications

Thesis

Patents

• Coordinated timing syncronization and time-aware shaping
• Notification of timing mismatches for queues in time sensitive networking

Links

Contact

• Facebook
• GitHub

Elements

i = 0;

while (!deck.isInOrder()) {
    print 'Iteration ' + i;
    deck.shuffle();
    i++;
}

print 'It took ' + i + ' iterations to sort the deck.';