Results 221 to 230 of about 236,167 (259)
Some of the next articles are maybe not open access.

Parameter convergence in source localization

2016 IEEE Conference on Control Applications (CCA), 2016
A source localization problem which is nonlinear is converted to a structured-noise linear problem. An algorithm is proposed and its convergence has been established.
openaire   +1 more source

Convergence in local press

2015 9th International Conference on Application of Information and Communication Technologies (AICT), 2015
Improvements in information and communication technologies have evolved the way of traditional broadcasting. This evolvement is currently being experienced in press, eliminating the specific and clear lines of every kind of medium. Changing news production/distribution process as well as readers' consumption tendencies have brought up some kind of ...
Ozhan Tingoy   +2 more
openaire   +2 more sources

Local convergence in Fermat's problem

Mathematical Programming, 1974
The general Fermat problem is to find the minimum of the weighted sum of distances fromm destination points in Euclideann-space. Kuhn recently proved that a classical iterative algorithm converges to the unique minimizing point , for any choice of the initial point except for a denumerable set.
openaire   +2 more sources

Stochastic localization of sources with convergence guarantees

2013 European Control Conference (ECC), 2013
We establish convergence guarantees for a recently proposed Markov Chain Monte Carlo (MCMC) method to locate source(s) of a certain concentration field. Our method utilizes a Markovian controller to control the motion of autonomous vehicles on a compact search domain.
Stephan M. Huck, John Lygeros
openaire   +1 more source

Local convergence of 'globally convergent' blind adaptive equalization algorithms

[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing, 1991
It is shown, through the analysis of nullspace for the channel convolution matrix, that the behavior of a finitely parameterized Godard equalizer in general can never achieve or approximate the desirable global convergence performance of an infinitely parameterized noncausal Godard equalizer.
Zhi Ding 0001   +2 more
openaire   +1 more source

Local convergence analysis for Chebyshev’s method

Journal of Applied Mathematics and Computing, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kumari, Chandni, Parida, P. K.
openaire   +1 more source

The Local Convergence of Boolean Networks With Disturbances

IEEE Transactions on Circuits and Systems II: Express Briefs, 2019
This brief is devoted to studying the local convergence of Boolean networks (BNs) with disturbances. On the one hand, the algebraic form of a BN with ${n}$ nodes and ${n}$ disturbances is obtained by semi-tensor product (STP) of matrices and, based on the algebraic expression, some conditions of the local convergence are presented.
Bowen Li 0006   +3 more
openaire   +2 more sources

Bornological Convergence in Locally Convex Cones

Mediterranean Journal of Mathematics, 2015
La notion de cône (la multiplication y est associative, mais non nécessairement commutative) localement convexe est bien connue comme celle de partie d'un espace vectoriel de même nature. On adapte sur un tel cône une structure bornologique classique, dont les AA. développent toutes les caractérisques. -- On regrettera l'absence d'exemples.
Ayaseh, Davood, Ranjbari, Asghar
openaire   +1 more source

Local uniform convergence and convergence of Julia sets

Nonlinearity, 1995
Let \(f\) be an entire function and denote by \(F_f\) the Fatou set and by \(J_f\) the Julia set of \(f\). Let \((f_n)\) be a sequence of entire functions which converges locally uniformly to \(f\). Theorem 1 says that if \(F_f\) consists only of basins of attracting cycles or if \(F_f\) is empty, then \(J_{f_n}\) converges to \(J_f\) in the Hausdorff ...
openaire   +2 more sources

Global convergence of local agent behaviors

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, 2005
Many multi-agent systems seek to reconcile two apparently inconsistent constraints. The system has a global overall objective. However, the agents have only local information to guide their actions. Such systems are presently more art than science. They often exhibit regularities (such as exponential convergence) that we do not understand, and we do ...
H. Van Dyke Parunak   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy