Results 331 to 340 of about 2,453,874 (341)
Some of the next articles are maybe not open access.
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.
Alexander Kesselman +2 more
openaire +2 more sources
The Convergence Arrow: A New Framework for Time, Causality, and Information Convergence
The Convergence Arrow is a novel framework that redefines time and causality by introducing information convergence as a fundamental principle in physics. Unlike the conventional Arrow of Time, which views time as an irreversible progression, the Convergence Arrow posits that future constraints actively shape present and past states.openaire +1 more source
The research of BGP convergence time
2011 6th IEEE Joint International Information Technology and Artificial Intelligence Conference, 2011BGP (Border Gateway Protocol) as a kind of mature routing protocols, has been widely applied in all kinds of largescale network. With regard to routing protocol, the important problem is the convergence time, which is an important index to evaluate the availability and robustness of network.
openaire +2 more sources
Convergence Times for Parallel Markov Chains
2006International ...
Lachaud, Béatrice, Ycart, Bernard
openaire +2 more sources
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 +2 more sources
Convergence of the Discretization in Time and Space
2001We study spatial approximations of Rosenbrock schemes by means of finite elements coupled with a Galerkin method. The error is evaluated in a discrete L t 2 (V)∩C t 0 (H) -norm under the usual assumption that the solution is temporally smooth. Since we are mainly interested in studying Rosenbrock methods of order p≥2, we need H t q (V) -regularity with
openaire +2 more sources
Convergence time of sidelobe cancellation systems
IEE Proceedings H Microwaves, Optics and Antennas, 1983A computer program has been written for the statistical investigation of the transient response of adaptive arrays of the radar sidelobe cancellation type, using multiple parallel feedback correlation loops. The expressions for the response are derived, the program is described in general terms, and some results are presented for a particular array ...
openaire +2 more sources
Omnitemporal logic and converging time
Theoria, 1975Max J. Cresswell, G. E. Hughes
openaire +2 more sources