359 search results - page 68 / 72 » Using graph analysis to study networks of adaptive agent |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
SIGCOMM
2004
ACM
14 years 1 months ago
2004
ACM
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
UAI
1996
13 years 9 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
EUROPAR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...