1480 search results - page 287 / 296 » Distributed algorithms for weighted problems in sparse graph... |
106
click to vote
ATAL
2011
Springer
13 years 11 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...
111
Voted
KDD
2008
ACM
16 years 5 days 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...
115
click to vote
CORR
2010
Springer
14 years 12 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...
104
click to vote
SECON
2007
IEEE
15 years 6 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...
101
click to vote
DC
2010
14 years 12 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...