Browsing by Subject "Via interconnection"
Now showing items 15 of 5

Conference Object
Distributed balancing of a digraph with integer weights
(Institute of Electrical and Electronics Engineers Inc., 2013)We address the integer weightbalancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology ...

Conference Object
Distributed formation of balanced and bistochastic weighted digraphs in multiagent systems
(2013)We propose two distributed algorithms, one for solving the weightbalance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information ...

Conference Object
Distributed minimumtime weight balancing over digraphs
(IEEE Computer Society, 2014)We address the weightbalancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). ...

Conference Object
Distributed strategies for average consensus in directed graphs
(2011)We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, strongly connected but possibly directed, topology ...

Conference Object
Distributed strategies for balancing a weighted digraph
(2012)A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weightbalanced digraphs play a key role ...