We present a divide-and-conquer method, called DiConic, for automatic addition of failsafe fault-tolerance to distributed programs, where a failsafe program guarantees to meet its...
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
– Peer-to-peer is a popular distributed system. Mobile ad hoc networks and peer-to-peer file sharing systems both lack fixed infrastructure support and hold no a-priori knowledge...
Abstract. Prototype-based clustering algorithms such as the Self Organizing Map (SOM) or Neural Gas (NG) offer powerful tools for automated data inspection. The distribution of pr...
Abstract. This paper studies the impact of omission failures on asynchronous distributed systems with crash-stop failures. We provide two different transformations for algorithms,...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...