In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
This paper investigates incremental multiagent learning in static or evolving structured networks. Learning examples are incrementally distributed among the agents, and the object...
Gauvain Bourgne, Amal El Fallah-Seghrouchni, Henry...
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...
Dimitris Achlioptas, Aaron Clauset, David Kempe, C...
Gossip-based epidemic protocols are used to aggregate data in distributed systems. This fault-tolerant approach does neither require maintenance of any global network state nor kno...
Structured peer-to-peer overlay network is an efficient solution for querying and retrieving resources spread between the peers. Unfortunately, key based routing of Distributed Ha...