Results 1  10
of
365,627
Convergence speed in distributed consensus and averaging
 IN PROC. OF THE 45TH IEEE CDC
, 2006
"... We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove ..."
Abstract

Cited by 133 (3 self)
 Add to MetaCart
We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We
Effects of Convergence Speed in Coordination Games
"... Using a computational testbed, we theoretically predict and experimentally show that in the minimum effort coordination game, as the cost of effort increases, 1) the game converges to lower effort levels, 2) the convergence speed increases, and 3) the average payoff is not monotonically decreasing. ..."
Abstract
 Add to MetaCart
Using a computational testbed, we theoretically predict and experimentally show that in the minimum effort coordination game, as the cost of effort increases, 1) the game converges to lower effort levels, 2) the convergence speed increases, and 3) the average payoff is not monotonically decreasing
MDL Convergence Speed for Bernoulli Sequences ∗
, 2006
"... The Minimum Description Length principle for online sequence estimation/prediction in a proper learning setup is studied. If the underlying model class is discrete, then the total expected square loss is a particularly interesting performance measure: (a) this quantity is finitely bounded, implying ..."
Abstract
 Add to MetaCart
convergence with probability one, and (b) it additionally specifies the convergence speed. For MDL, in general one can only have loss bounds which are finite but exponentially larger than those for Bayes mixtures. We show that this is even the case if the model class contains only Bernoulli distributions. We
Convergence speed of binary interval consensus
 In Proceedings of the 29th conference on Information communications, INFOCOM’10
, 2010
"... We consider the convergence time for solving the binary consensus problem using the interval consensus algorithm proposed by Bénézit, Thiran and Vetterli (2009). In the binary consensus problem, each node initially holds one of two states and the goal for each node is to correctly decide which one ..."
Abstract

Cited by 18 (3 self)
 Add to MetaCart
We consider the convergence time for solving the binary consensus problem using the interval consensus algorithm proposed by Bénézit, Thiran and Vetterli (2009). In the binary consensus problem, each node initially holds one of two states and the goal for each node is to correctly decide which
Monetary Expansion and Converging Speed in a Growing Economy
, 2002
"... This paper explores the effect of monetary policy on the speed of convergence. Using a neoclassical monetary growth model with a cashinadvance constraint, we conduct numerical evaluation of the effect of changes in the growth rate of money supply on the converging speed of the economy. We find tha ..."
Abstract
 Add to MetaCart
This paper explores the effect of monetary policy on the speed of convergence. Using a neoclassical monetary growth model with a cashinadvance constraint, we conduct numerical evaluation of the effect of changes in the growth rate of money supply on the converging speed of the economy. We find
Accelerating the convergence speed of neural networks
"... learning methods using least squares ..."
ADAPTIVE IIR FILTERING: CONVERGENCE SPEED PROPERTIES IN THE
"... Previous results based on balanced realization theory and concerning the local convergence speed of adaptive IIR filters apply to the sufficient order case. In the undermodelled case, situations of greater practical interest are those in which the order chosen for the adaptive filter provides a good ..."
Abstract
 Add to MetaCart
Previous results based on balanced realization theory and concerning the local convergence speed of adaptive IIR filters apply to the sufficient order case. In the undermodelled case, situations of greater practical interest are those in which the order chosen for the adaptive filter provides a
Empirical Investigation of the Convergence Speed of Inclusion Functions
"... This paper deals with the empirical convergence speed of inclusion functions. According to our experience the natural interval extension of a given function can be as good as a usual quadratically convergent inclusion function, and although centered forms are in general only secondorder, they can p ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
This paper deals with the empirical convergence speed of inclusion functions. According to our experience the natural interval extension of a given function can be as good as a usual quadratically convergent inclusion function, and although centered forms are in general only secondorder, they can
On the Convergence Speed of Spatially Coupled LDPC Ensembles
"... Abstract—Spatially coupled lowdensity paritycheck codes show an outstanding performance under the lowcomplexity belief propagation (BP) decoding algorithm. They exhibit a peculiar convergence phenomenon above the BP threshold of the underlying noncoupled ensemble, with a wavelike convergence pr ..."
Abstract
 Add to MetaCart
the successful decoding solution. We derive an upper bound on the propagation speed, only depending on the basic parameters of the spatially coupled code ensemble such as degree distribution and the coupling factor w. We illustrate the convergence speed of different code ensembles by simulation results, and show
Improving Convergence Speed and Scalability in OSPF: A Survey
, 2011
"... Open Shortest Path First (OSPF), a link state routing protocol, is a popular interior gateway protocol (IGP) in the Internet. Wide spread deployment and years of experience running the protocol have motivated continuous improvements in its operation as the nature and demands of the routing infrastru ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
highly scalable operation on part of OSPF to avoid routing instability. Recent years have seen significant efforts aimed at improving OSPF’s convergence speed as well as scalability and extending OSPF to achieve seamless integration of mobile adhoc networks with conventional wired networks. In this paper
Results 1  10
of
365,627