Search
Now showing items 31-40 of 53
Distributed network size estimation and average degree estimation and control in networks isomorphic to directed graphs
(2012)
Many properties of interest in graph structures are based on the nodes' average degree (i.e., the average number of edges incident to/from each node). In this work, we present asynchronous distributed algorithms, based on ...
Soft-decision decoding of linear block codes using preprocessing
(2004)
Two universally applicable preprocessing rules to improve iterative recoding algorithms, which utilize the most reliable basis (MRB), while focusing on order-w reprocessing, was investigated. The first preprocessing rule ...
Soft-decision decoding of linear block codes using multiple information bases
(2003)
A previous study addressed algorithms that perform soft-decision decoding by utilizing encodings of test error patterns (TEPs) on the so-called "most reliable basis" which can be obtained by a greedy search algorithm. In ...
Resilient average consensus in the presence of heterogeneous packet dropping links
(2012)
We address the average-consensus problem for a distributed system whose components (nodes) can exchange information via unreliable interconnections (edges) that form an arbitrary, possibly directed topology (digraph). We ...
Optimal preprocessing strategies for perfect reconstruction of binary signals under power-constrained transmission
(2004)
In this paper we further explore our deterministic worst-case framework for perfect reconstruction of discrete data transmissions through dispersive communication channels. Specifically, we are concerned with perfect ...
Infinite horizon average cost dynamic programming subject to ambiguity on conditional distribution
(Institute of Electrical and Electronics Engineers Inc., 2015)
This paper addresses the optimality of stochastic control strategies based on the infinite horizon average cost criterion, subject to total variation distance ambiguity on the conditional distribution of the controlled ...
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. Weight-balanced digraphs play a key role ...
A Perfect Reconstruction Paradigm for Digital Communication
(2003)
In this paper we present a deterministic worst-case framework for reconstruction of discrete data transmissions through dispersive communication channels. This framework can be explored based on robust control ideas and ...
Wireless data broadcast in systems of hierarchical cellular organization
(2003)
In recent years, both wireless data broadcast (WDB) and hierarchical cell structure (HCS) have attracted the attention of the scientific community, yet they have been treated as entirely separate research topics. This paper ...
Reconstruction of transition firing sequences based on asynchronous observations of place token changes
(2007)
This paper proposes a methodology for reconstructing the possible transition firing sequences in a given Petri net based on asynchronous observations of token changes at different places of the Petri net. The observed ...