Results 331 to 340 of about 20,023,457 (377)
Some of the next articles are maybe not open access.

Adaptive Parameter Estimation and Control Design for Robot Manipulators With Finite-Time Convergence

IEEE transactions on industrial electronics (1982. Print), 2018
For parameter identifications of robot systems, most existing works have focused on the estimation veracity, but few works of literature are concerned with the convergence speed.
Chenguang Yang   +5 more
semanticscholar   +1 more source

Convergence Time for the Linkage Learning Genetic Algorithm

Evolutionary Computation, 2004
This paper identifies the sequential behavior of the linkage learning genetic algorithm, introduces the tightness time model for a single building block, and develops the connection between the sequential behavior and the tightness time model. By integrating the first-building-block model based on the sequential behavior, the tightness time model, and
Ying-ping, Chen, David E, Goldberg
openaire   +2 more sources

On the character of convergence to Brownian local time. II

Probability Theory and Related Fields, 1986
The local time, l(t,x), of a Brownian motion process w(s) \((E(w^ 2(s))=Ds ...
openaire   +2 more sources

Design of controllers with arbitrary convergence time

at - Automatisierungstechnik, 2020
Anil Kumar Pal   +4 more
semanticscholar   +1 more source

Real-time model and convergence time of BGP

Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2003
BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time model of BGP. We then state and prove a general theorem providing an upper bound on convergence time.
openaire   +1 more source

GNN Model for Time-Varying Matrix Inversion With Robust Finite-Time Convergence

IEEE Transactions on Neural Networks and Learning Systems, 2022
Yinyan Zhang   +3 more
semanticscholar   +1 more source

Convergence Time to Nash Equilibria

2003
We 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

Breast Cancer Statistics, 2022

Ca-A Cancer Journal for Clinicians, 2022
Hyuna Sung   +2 more
exaly  

Home - About - Disclaimer - Privacy