Results 11 to 20 of about 174,873,121 (310)
Analysis and Evaluation of the Family of Sign Adaptive Algorithms [PDF]
, 2022 In this thesis, four novel sign adaptive algorithms proposed by the author were analyzed and evaluated for floating-point arithmetic operations. These four algorithms include Sign Regressor Least Mean Fourth (SRLMF), Sign Regressor Least Mean Mixed-Norm (
Ulla Faiz, Mohammed
core +1 more source
A mathematical theory of synchronous concurrent algorithms [PDF]
, 1987 A synchronous concurrent algorithm is an algorithm that is described as a network of intercommunicating processes or modules whose concurrent actions are synchronised with respect to a global clock.
Thompson, Benjamin Criveli
core +5 more sources
An Analysis of the WITT Algorithm [PDF]
Machine Learning, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jan L. Talmon +2 more
openaire +3 more sources
Convergence Rates in the Probabilistic Analysis of Algorithms [PDF]
, 2020 In this extended abstract a general framework is developed to bound rates of convergence for sequences of random variables as they mainly arise in the analysis of random trees and divide-and-conquer algorithms. The rates of convergence are bounded in the
Neininger, Ralph, Straub, Jasmin
core +1 more source
On testing global optimization algorithms for space trajectory design [PDF]
, 2008 In this paper we discuss the procedures to test a global search algorithm applied to a space trajectory design problem. Then, we present some performance indexes that can be used to evaluate the effectiveness of global optimization algorithms.
Marco Locatelli +7 more
core +4 more sources
Series acceleration formulas obtained from experimentally discovered hypergeometric recursions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 In 2010, Kh. Hessami Pilehrood and T. Hessami Pilehrood introduced generating function identities used to obtain series accelerations for values of Dirichlet's $\beta$ function, via the Markov--Wilf--Zeilberger method.
Paul Levrie, John Campbell
doaj +1 more source
Convergence of some leader election algorithms [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We start with a set of $n$ players. With some probability $P(n,k)$, we kill $n-k$ players; the other ones stay alive, and we repeat with them. What is the distribution of the number $X_n$ of \emph{phases} (or rounds) before getting only one player?
Svante Janson +2 more
doaj +1 more source
A note on limits of sequences of binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a characterization of the ...
Rudolf Grübel
doaj +1 more source
The repetition threshold for binary rich words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and Shallit produced an infinite binary rich word with critical exponent $2+\sqrt{2}/2$ ($\approx 2.707$
James D. Currie +2 more
doaj +1 more source
On a Nonsmooth Gauss–Newton Algorithms for Solving Nonlinear Complementarity Problems [PDF]
, 2020 In this paper, we propose a new version of the generalized damped Gauss–Newton method for solving nonlinear complementarity problems based on the transformation to the nonsmooth equation, which is equivalent to some unconstrained optimization problem ...
Marek J. Śmietański +1 more
core +1 more source