Results 221 to 230 of about 340,729 (265)
Some of the next articles are maybe not open access.
Convergence of Averaged Occupation Times
Canadian Mathematical Bulletin, 1975Let X = {Xt, t ≥ 0} be a stationary Markov process with values in a measurable space (S, ℬ), transition function p, and initial distribution concentrated at a point x ∊ S. The occupation times of a set A ∊ ℬ are defined for t ≥ 0 bywhere 1A is the indicator function of A.
openaire +1 more source
Finite- and fixed-time convergent algorithms: Design and convergence time estimation
Annual Reviews in Control, 2019Abstract This paper presents a review of finite- and fixed-time convergent algorithms for dynamic systems of various dimensions and relative degrees, with or without disturbances. The review mainly focuses on finite- and fixed-time convergent algorithms, which provide explicit and easily computable upper estimates for the corresponding convergence ...
openaire +1 more source
Convergence acceleration for simulated time‐reversal
COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, 2009Summary: Purpose - The purpose of this paper is to report on the use of conjugate-gradients (CG) as a means to accelerate the convergence of the iterative time-reversal algorithm used for optimisation of electromagnetic devices. Design/methodology/approach - The numerical time-domain transmission line modelling method is used for time-reversal ...
Scott, I., Vukovic, A., Sewell, P.
openaire +2 more sources
On the convergence condition and convergence time of BGP
Computer Communications, 2011The Internet composes of thousands of Autonomous System (ASes). The Border Gateway Protocol (BGP) is the standard protocol for sharing inter-domain routing information. Unlike OSPF and IS-IS, BGP allows an AS to use a lot of attributes to express semantic rich routing policies that are consistent with its desired economic, business, performance, and ...
Huaming Guo +3 more
openaire +1 more source
Convergence time in Hopfield network
Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium, 2000Convergence time in Hopfield attractor neural network with parallel dynamics is investigated by computer simulation of networks of extremely large size (up to the number of neurons N=10/sup 5/). A special algorithm is used to avoid storage in the computer memory of both connection matrix and the set of stored prototypes. Thus, the size of the simulated
A.A. Frolov, D. Husek
openaire +1 more source
Discrete time credibilistic processes: Construction and convergences
Information Sciences, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kageyama, Masayuki, Iwamura, Kakuzo
openaire +2 more sources
Experiments of ASON convergence time
SPIE Proceedings, 2005A network test bed with 100 network simulative nodes is set up. Convergence time experiments and signalling network flow experiments of Automatically Switched Optical Networks using Hierarchical Routing Protocol have been performed on it, and an experiment analysis is given.
Chao Bian, Hanyi Zhang
openaire +1 more source
2013
This chapter considers the historical lineage and conceptual origins of visual music, addressing the turn to abstraction and absolute film in visual arts, particularly in the first half of the twentieth century, and the turn to mimesis and spatialization in music, particularly through the acousmatic tradition after World War II.
Bret Battey, Rajmil Fischman
openaire +1 more source
This chapter considers the historical lineage and conceptual origins of visual music, addressing the turn to abstraction and absolute film in visual arts, particularly in the first half of the twentieth century, and the turn to mimesis and spatialization in music, particularly through the acousmatic tradition after World War II.
Bret Battey, Rajmil Fischman
openaire +1 more source
Convergence Time to Nash Equilibria
2003We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will minimize its cost. We consider a variety of load balancing models, including identical, restricted, related and unrelated machines.
Eyal Even-Dar +2 more
openaire +1 more source
On the Convergence of Time‐Discrete Processes
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1994AbstractWe prove a general convergence result for a multistep time‐discrete process equation image under very mild conditions on the function V. We discuss the application to boundary value‐ and boundary layer problems. Our proof is a straight‐forward argument without any concepts for stability or consistency.
openaire +2 more sources