Search Results - "Devismes, S."

Stabilizing leader election in partial synchronous systems with crash failures by Delporte-Gallet, C., Devismes, S., Fauconnier, H.

“…This article deals with stabilization and fault-tolerance. We consider two types of stabilization: the self- and pseudo-stabilization. Our goal is to implement…”
Get full text

Thermal behavior of PVDF/PMMA blends by differential scanning calorimetry and vibrational spectroscopies (Raman and Fourier-Transform Infrared) by Veitmann, M., Chapron, D., Bizet, S., Devisme, S., Guilment, J., Royaud, I., Poncot, M., Bourson, P.

“…PVDF/PMMA blend exhibits a complex DSC thermogram due to the presence of multiple crystalline phases. This paper shows that Raman and FTIR spectroscopies allow…”
Get full text

A Self-Stabilizing O(n)-Round k-Clustering Algorithm by Datta, A.K., Devismes, S., Larmore, L.L.

“…Given an arbitrary network G of processes with unique IDs and no designated leader, and given a k-dominating set I C G, we propose a silent self-stabilizing…”
Get full text

Competitive Self-Stabilizing k-Clustering by Datta, A. K., Larmore, L. L., Devismes, S., Heurtefeux, K., Rivierre, Y.

“…In this paper, we propose a silent self-stabilizing asynchronous distributed algorithm for constructing a kclustering of any connected network with unique IDs…”
Get full text

Communication Efficiency in Self-Stabilizing Silent Protocols by Devismes, S., Masuzawa, T., Tixeuil, S.

“…In this paper, our focus is to lower the communication complexity of self-stabilizing protocols below the need of checking every neighbor forever. Our…”
Get full text

Snap-Stabilizing Depth-First Search on Arbitrary Networks by Cournier, A.

“…A snap-stabilizing protocol, starting from any arbitrary initial configuration, always behaves according to its specification. In this paper, we present the…”
Get full text

Snap-stabilizing PIF and useless computations by Cournier, A., Devismes, S., Villain, V.

“…A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a…”
Get full text

Weak vs. Self vs. Probabilistic Stabilization by Devismes, S., Tixeuil, S., Yamashita, M.

“…Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker…”
Get full text

Snap-Stabilizing Committee Coordination by Bonakdarpour, B., Devismes, S., Petit, F.

“…In this paper, we propose two snap-stabilizing distributed algorithms for the committee coordination problem. In this problem, a committee consists of a set of…”
Get full text

Sorting on Skip Chains by Datta, A. K., Larmore, L. L., Devismes, S.

“…We introduce a generalization of the distributed sorting problem on chain network. Our problem consists of sorting values in processes that are separated from…”
Get full text

Self-Stabilizing Small k-Dominating Sets by Devismes, S., Heurtefeux, K., Rivierre, Y., Datta, A. K., Larmore, L. L.

“…A self-stabilizing algorithm, after transient faults hit the system and place it in some arbitrary global state, recovers in finite time without external…”
Get full text

Multi-resource Allocation with Unknown Participants by Datta, A. K., Larmore, L. L., Devismes, S., Kawala, F., Potop-Butucaru, M.

“…We define the problem of multi-resource allocation, which is an extension of the dining philosophers problem. We apply this problem to systems where…”
Get full text

Space-Optimal Deterministic Rendezvous by Carrier, F., Devismes, S., Petit, F., Rivierre, Y.

“…In this paper, we address the deterministic rendezvous of mobile agents into any unoriented connected graph. The agents are autonomous, oblivious, move…”
Get full text

Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks by Bernard, S., Devismes, S., Potop-Butucaru, M.G., Tixeuil, S.

“…A distributed algorithm is self-stabilizing if after faults and attacks hit the system and place it in some arbitrary global state, the systems recovers from…”
Get full text

Self-Stabilizing k-out-of-ℓ exclusion on tree networks by Datta, A.K., Devismes, S., Horn, F., Larmore, L.L.

“…In this paper, we address the problem of k-out-of-lscr exclusion, a generalization of the mutual exclusion problem, in which there are lscr units of a shared…”
Get full text