1480 search results - page 164 / 296 » Distributed algorithms for weighted problems in sparse graph... |
102
click to vote
JMLR
2006
15 years 20 days ago
2006
In this article we describe a set of scalable techniques for learning the behavior of a group of agents in a collaborative multiagent setting. As a basis we use the framework of c...
CORR
2010
Springer
15 years 24 days ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
100
click to vote
DISOPT
2008
15 years 23 days ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
158
Voted
GPC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...
175
Voted
SIGMOD
2009
ACM
16 years 28 days ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...