International audienceA strategy to increase an algorithm's robustness against internal memory corruption is to let processes actively discard part of their accumulated knowledge during execution. We study how different strategies of forgetting affect the performance of a synchronizer in an environment with probabilistic message loss
International audienceFast checkpointing algorithms require distributed access to stable storage. Th...
International audienceIn this paper, we revisit traditional checkpointing and rollback recovery stra...
We study the learning of an external signal by a neural network and the time to forget it when this ...
International audienceWe study variants of the α -synchronizer by Awerbuch (J. ACM, 1985) within a d...
AbstractWe study variants of the α-synchronizer by Awerbuch (1985) within a distributed message pass...
International audienceDesigning algorithms for distributed systems that provide a round abstraction ...
AbstractDesigning algorithms for distributed systems that provide a round abstraction is often simpl...
This invited talk surveys notions related to synchronization in presence of asynchrony and failures....
International audienceThe time-based resource-sharing model of working memory assumes that memory tr...
Embedded devices usually share only partial information about their current configurations as the co...
Designing algorithms for distributed systems that provide a round abstraction is often simpler than ...
International audienceThere is still a strong debate in the working memory literature about the caus...
In this thesis, we study aspects of coding against synchronisation errors, such as deletions and rep...
People tend not to have perfect memories when it comes to learning, or to anything else for that mat...
In this paper we propose several novel approaches for incorporating forgetting mechanisms into seque...
International audienceFast checkpointing algorithms require distributed access to stable storage. Th...
International audienceIn this paper, we revisit traditional checkpointing and rollback recovery stra...
We study the learning of an external signal by a neural network and the time to forget it when this ...
International audienceWe study variants of the α -synchronizer by Awerbuch (J. ACM, 1985) within a d...
AbstractWe study variants of the α-synchronizer by Awerbuch (1985) within a distributed message pass...
International audienceDesigning algorithms for distributed systems that provide a round abstraction ...
AbstractDesigning algorithms for distributed systems that provide a round abstraction is often simpl...
This invited talk surveys notions related to synchronization in presence of asynchrony and failures....
International audienceThe time-based resource-sharing model of working memory assumes that memory tr...
Embedded devices usually share only partial information about their current configurations as the co...
Designing algorithms for distributed systems that provide a round abstraction is often simpler than ...
International audienceThere is still a strong debate in the working memory literature about the caus...
In this thesis, we study aspects of coding against synchronisation errors, such as deletions and rep...
People tend not to have perfect memories when it comes to learning, or to anything else for that mat...
In this paper we propose several novel approaches for incorporating forgetting mechanisms into seque...
International audienceFast checkpointing algorithms require distributed access to stable storage. Th...
International audienceIn this paper, we revisit traditional checkpointing and rollback recovery stra...
We study the learning of an external signal by a neural network and the time to forget it when this ...