Results 31 to 40 of about 324,949 (317)

Rate of convergence of Lawson’s algorithm [PDF]

open access: yesMathematics of Computation, 1972
The algorithm of Charles L. Lawson determines uniform approximations of functions as limits of weighted L 2
openaire   +2 more sources

The Sinkhorn-Knopp algorithm : convergence and applications [PDF]

open access: yes, 2008
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic.
Knight, P.A.
core   +1 more source

On the Rate of Convergence of Fictitious Play

open access: yesTheory of Computing Systems, 2010
The article puts forward three theorems (with their proofs) concerning the convergence rate of almost all the classes of games where fictitious play is known to converge. All the three observations demonstrate that the size of the game requires in some situations exponentially many rounds until an equilibrium action is eventually played.
Felix Brandt   +2 more
openaire   +3 more sources

The human gut microbiome across the life course

open access: yesFEBS Letters, EarlyView.
Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero   +4 more
wiley   +1 more source

Federated Semi-Supervised Learning with Uniform Random and Lattice-Based Client Sampling

open access: yesEntropy
Federated semi-supervised learning (Fed-SSL) has emerged as a powerful framework that leverages both labeled and unlabeled data distributed across clients. To reduce communication overhead, real-world deployments often adopt partial client participation,
Mei Zhang, Feng Yang
doaj   +1 more source

Convergence and rate of convergence of a simple ant model [PDF]

open access: yesProceedings of the 6th international joint conference on Autonomous agents and multiagent systems, 2007
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes the solution of some optimal control problem and converges in some well defined sense.
Boumaza, Amine, Scherrer, Bruno
openaire   +3 more sources

Microbiome−host proteostasis crosstalk—An emerging perspective on mechanisms and interventions toward healthy longevity

open access: yesFEBS Letters, EarlyView.
Proteostasis and the gut microbiota play a key role in shaping host physiology. Microbiota‐derived metabolites, vitamins, and RNA modulate host proteostasis. Findings from model systems, including C. elegans, indicate microbes can either stabilize or disrupt host proteostasis.
Abhishek Anil Dubey, Maria Ermolaeva
wiley   +1 more source

A Quasi-Boundary Value Method for Solving a Backward Problem of the Fractional Rayleigh–Stokes Equation

open access: yesAxioms
In this paper, we study a backward problem for a fractional Rayleigh–Stokes equation by using a quasi-boundary value method. This problem is ill-posed; i.e., the solution (if it exists) does not depend continuously on the data.
Xiaomin Wang, Aimin Yang
doaj   +1 more source

From mice to humans—divergent strategies for intestinal homeostasis and regeneration

open access: yesFEBS Letters, EarlyView.
Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa   +2 more
wiley   +1 more source

A Discrete-Time Fractional-Order Flocking Control Algorithm of Multi-Agent Systems

open access: yesFractal and Fractional
In this paper, a discrete-time fractional flocking control algorithm of multi-agent systems is put forward to address the slow convergence issue of multi-agent systems. Firstly, by introducing Grünwald-Letnikov (G-L) fractional derivatives, the algorithm
Haotian Chen   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy