Results 11 - 20 of 5,322

A simple distributed autonomous power control algorithm and its convergence

by Gerard J. Foschini, Zoran Miljanic - IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY , 1993
"... For wireless cellular communication systems, one seeks a simple effective means of power control of signals associated with randomly dispersed users that are reusing a single channel in different cells. By effecting the lowest interference environment, in meeting a required minimum signal-to-interf ..."
Abstract - Cited by 477 (3 self) - Add to MetaCart
distributed type of algorithm, whenever power settings exist for which all users meet the p requirement, we demonstrate exponentially fast convergence to these settings.

A fast iterative shrinkage-thresholding algorithm with application to . . .

by Amir Beck, Marc Teboulle , 2009
"... We consider the class of Iterative Shrinkage-Thresholding Algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods is attractive due to its simplicity, however, they are also known to converge quite slowly. In this paper we present a Fast Iterat ..."
Abstract - Cited by 1058 (9 self) - Add to MetaCart
We consider the class of Iterative Shrinkage-Thresholding Algorithms (ISTA) for solving linear inverse problems arising in signal/image processing. This class of methods is attractive due to its simplicity, however, they are also known to converge quite slowly. In this paper we present a Fast

Strategies for fast convergence in semiotic dynamics

by Andrea Baronchelli, Alain Barrat, Vittorio Loreto , 2005
"... Semiotic dynamics is a novel field that studies how semiotic conventions spread and stabilize in a population of agents. This is a central issue both for theoretical and technological reasons since large system made up of communicating agents, like web communities or artificial embodied agents teams ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
the performance of the game in terms of faster convergence and reduced cognitive effort for the agents.

Irrationality of a fast converging series of rational numbers

by Daniel Duverney - MATH. PROC. CAMBRIDGE PHILOS. SOC
"... We say that the series of general term un = 0 is fast converging if log |un | ≤ c2n for some c < 0. We prove irrationality results and compute irrationality measures for some fast converging series of rational numbers, by using Mahler’s transcendence method in the form introduced by Loxton an ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
We say that the series of general term un = 0 is fast converging if log |un | ≤ c2n for some c < 0. We prove irrationality results and compute irrationality measures for some fast converging series of rational numbers, by using Mahler’s transcendence method in the form introduced by Loxton

Abstract Fast Convergence of Selfish Rerouting

by unknown authors
"... We consider n anonymous selfish users that route their communication through m parallel links. The users are allowed to reroute, concurrently, from overloaded links to underloaded links. The different rerouting decisions are concurrent, randomized and independent. The rerouting process terminates wh ..."
Abstract - Add to MetaCart
when the system reaches a Nash equilibrium, in which no user can improve its state. We study the convergence rate of several migration policies. The first is a very natural policy, which balances the expected load on the links, for the case that all users are identical and apply it, we show

Abstract Fast Convergence of Selfish Rerouting ∗

by unknown authors
"... We consider n anonymous selfish users that route their communication through m parallel links. The users are allowed to reroute, concurrently, from overloaded links to underloaded links. The different rerouting decisions are concurrent, randomized and independent. The rerouting process terminates wh ..."
Abstract - Add to MetaCart
when the system reaches a Nash equilibrium, in which no user can improve its state. We study the convergence rate of several migration policies. The first is a very natural policy, which balances the expected load on the links, for the case that all users are identical and apply it, we show

Fast convergence in evolutionary models: A Lyapunov approach∗

by Glenn Ellison, Drew Fudenberg, Lorens A. Imhof , 2014
"... Evolutionary models in which N players are repeatedly matched to play a game have “fast convergence ” to a set A if the models both reach A quickly and leave A slowly, where “quickly ” and “slowly ” refer to whether the expected hitting and exit times remain finite in the N → ∞ limit. We provide Ly ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Evolutionary models in which N players are repeatedly matched to play a game have “fast convergence ” to a set A if the models both reach A quickly and leave A slowly, where “quickly ” and “slowly ” refer to whether the expected hitting and exit times remain finite in the N → ∞ limit. We provide

A new timing recovery architecture for fast convergence

by Piya Kovintavewat, John R. Barry - IEEE International Symposium on Circuits and Systems , 2003
"... For any given communication channel, it is desirable to recover all the initial timing information during acquisition and/or any phase and frequency changes during tracking as fast as possible. In this paper, we propose the oversampled per-survivor processing (PSP) timing recovery (TR) architecture ..."
Abstract - Cited by 6 (5 self) - Add to MetaCart
to achieve fast convergence rate in the applications of magnetic recording channels. Its performance is compared with the symbol-rate PSP-based TR, the oversampled conventional TR (OCTR), and also with the symbolrate conventional TR (CTR) architecture used in today’s magnetic recording read-channel chip

A Fast and Elitist Multi-Objective Genetic Algorithm: NSGA-II

by Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, T. Meyarivan , 2000
"... Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing param ..."
Abstract - Cited by 1815 (60 self) - Add to MetaCart
parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algorithm (we called it the Non-dominated Sorting GA-II or NSGA-II) which alleviates all the above three difficulties. Specifically, a fast non-dominated sorting approach with O(MN ) computational complexity

Convergence across States and Regions

by Xavier Sala-i-martin - Brookings Papers on Economic Activity , 1991
"... AN IMPORTANT economic question is whether poor countries or regions tend to converge toward rich ones. We want to know, for example, whether the poor countries of Africa, South Asia, and Latin America will grow faster than the developed countries, whether the south of Italy will become like its nort ..."
Abstract - Cited by 421 (1 self) - Add to MetaCart
north, whether and how fast the eastern regions of Germany will attain the prosperity of the western regions, and-in a historical context-how the American South became nearly as well off as the North. Although some economic theories predict convergence, the empirical evidence has been a subject
Results 11 - 20 of 5,322