Franck Petit
YOU?
Author Swipe
View article: When should you wait before updating? - Toward a robustness refinement
When should you wait before updating? - Toward a robustness refinement Open
View article: Optimal Memory Requirement for Self-stabilizing Token Circulation
Optimal Memory Requirement for Self-stabilizing Token Circulation Open
View article: Neural network-based emulation of interstellar medium models
Neural network-based emulation of interstellar medium models Open
Context. The interpretation of observations of atomic and molecular tracers in the galactic and extragalactic interstellar medium (ISM) requires comparisons with state-of-the-art astrophysical models to infer some physical conditions. Usua…
View article: On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics † ‡
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics † ‡ Open
We consider self-stabilization and its weakened form called pseudo-stabilization. We study conditions under which (pseudo- and self-) stabilizing leader election is solvable in networks subject to frequent topological changes. To model suc…
View article: The extremely sharp transition between molecular and ionized gas in the Horsehead nebula
The extremely sharp transition between molecular and ionized gas in the Horsehead nebula Open
Massive stars can determine the evolution of molecular clouds by eroding and photo-evaporating their surfaces with strong ultraviolet (UV) radiation fields. Moreover, UV radiation is relevant in setting the thermal gas pressure in star-for…
View article: Self-stabilizing systems in spite of high dynamics
Self-stabilizing systems in spite of high dynamics Open
View article: Mixture of noises and sampling of non-log-concave posterior distributions
Mixture of noises and sampling of non-log-concave posterior distributions Open
This work considers a challenging radio-astronomyinverse problem of physical parameter inference from multispec-tral observations. The forward model underlying this problem isa computationally expensive numerical simulation. In addition,th…
View article: When Should You Wait Before Updating? Toward a Robustness Refinement
When Should You Wait Before Updating? Toward a Robustness Refinement Open
Consider a dynamic network and a given distributed problem. At any point in time, there might exist several solutions that are equally good with respect to the problem specification, but that are different from an algorithmic perspective, …
View article: De la RSE à la responsabilité sociale des employeurs
De la RSE à la responsabilité sociale des employeurs Open
International audience
View article: Le préjudice d’angoisse de mort imminente est un poste de préjudice autonome et différent des souffrances endurées
Le préjudice d’angoisse de mort imminente est un poste de préjudice autonome et différent des souffrances endurées Open
International audience
View article: Détection de terminaison silencieuse, anonyme, stabilisante instantanément
Détection de terminaison silencieuse, anonyme, stabilisante instantanément Open
International audience
View article: On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics
On Implementing Stabilizing Leader Election with Weak Assumptions on Network Dynamics Open
International audience
View article: Self-stabilizing Systems in Spite of High Dynamics
Self-stabilizing Systems in Spite of High Dynamics Open
International audience
View article: Group Mutual Exclusion to Scale Distributed Stream Processing Pipelines
Group Mutual Exclusion to Scale Distributed Stream Processing Pipelines Open
International audience
View article: Merge, Split, and Cluster: Dynamic Deployment of Stream Processing Applications
Merge, Split, and Cluster: Dynamic Deployment of Stream Processing Applications Open
International audience
View article: Élection Autostabilisante dans les Réseaux à Haute Dynamicité
Élection Autostabilisante dans les Réseaux à Haute Dynamicité Open
National audience
View article: Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics
Brief Announcement: Self-stabilizing Systems in Spite of High Dynamics Open
International audience
View article: Deterministic Treasure Hunt in the Plane with Angular Hints
Deterministic Treasure Hunt in the Plane with Angular Hints Open
View article: Almost Universal Anonymous Rendezvous in the Plane
Almost Universal Anonymous Rendezvous in the Plane Open
Two mobile agents represented by points freely moving in the plane and starting at two distinct positions, have to meet. The meeting, called rendezvous, occurs when agents are at distance at most $r$ of each other and never move after this…
View article: FogGuru: a Fog Computing Platform Based on Apache Flink
FogGuru: a Fog Computing Platform Based on Apache Flink Open
International audience
View article: Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots Open
We consider swarms of asynchronous oblivious robots evolving into an anonymous grid-shaped network. In this context, we investigate optimal (w.r.t. the number of robots) deterministic solutions for the terminating exploration problem. We f…
View article: Design and Evaluation of Decentralized Scaling Mechanisms for Stream Processing
Design and Evaluation of Decentralized Scaling Mechanisms for Stream Processing Open
International audience
View article: Robustness: A new form of heredity motivated by dynamic networks
Robustness: A new form of heredity motivated by dynamic networks Open
View article: A Fully Decentralized Autoscaling Algorithm for Stream Processing Applications
A Fully Decentralized Autoscaling Algorithm for Stream Processing Applications Open
International audience
View article: Trouver un trésor plus rapidement avec des conseils angulaires
Trouver un trésor plus rapidement avec des conseils angulaires Open
International audience
View article: Asynchronous approach in the plane: a deterministic polynomial algorithm
Asynchronous approach in the plane: a deterministic polynomial algorithm Open
View article: Approche asynchrone dans le plan : un algorithme déterministe polynomial
Approche asynchrone dans le plan : un algorithme déterministe polynomial Open
International audience
View article: Stabilisation progressive
Stabilisation progressive Open
International audience
View article: Gracefully Degrading Gathering in Dynamic Rings
Gracefully Degrading Gathering in Dynamic Rings Open
Gracefully degrading algorithms [Biely \etal, TCS 2018] are designed to circumvent impossibility results in dynamic systems by adapting themselves to the dynamics. Indeed, such an algorithm solves a given problem under some dynamics and, m…
View article: Optimal torus exploration by oblivious robots
Optimal torus exploration by oblivious robots Open