In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Widespread accounts of the harmful effects of invasive species have stimulated both practical and theoretical studies on how the spread of these destructive agents can be containe...
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
— In this paper, we present a scalable, decentralized task allocation algorithm for a group of unknown number of Unmanned Aerial Vehicles (UAVs), which are equipped with GPS rece...
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...