1480 search results - page 287 / 296 » Distributed algorithms for weighted problems in sparse graph... |
141
click to vote
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
In multi-agent planning environments, action models for each agent must be given as input. However, creating such action models by hand is difficult and time-consuming, because i...
141
click to vote
KDD
2008
ACM
16 years 3 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
150
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...
135
click to vote
SECON
2007
IEEE
15 years 9 months ago
2007
IEEE
—In this paper, we develop a joint Network Coding (NC)-channel coding error-resilient sensor-network approach that performs In-Network Processing based on channel code Design (IN...
134
click to vote
DC
2010
15 years 3 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...