Results 11 to 20 of about 1,094,599 (317)
Analytic analysis of algorithms [PDF]
, 1992 The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial structures.
Philippe Flajolet, Flajolet, Philippe
core +4 more sources
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
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
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
A functional limit law for the profile of plane-oriented recursive trees. [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We give a functional limit law for the normalized profile of random plane-oriented recursive trees. The proof uses martingale convergence theorems in discrete and continuous-time. This complements results of Hwang (2007).
Henning Sulzbach
doaj +1 more source
The Optimal Lower Bound for Generators of Invariant Rings without Finite SAGBI Bases with Respect to Any Admissible Order [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We prove the existence of an invariant ring \textbfC[X_1,...,X_n]^T generated by elements with a total degree of at most 2, which has no finite SAGBI basis with respect to any admissible order. Therefore, 2 is the optimal lower bound for the total degree
Manfred Göbel
doaj +1 more source
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
Anti-power $j$-fixes of the Thue-Morse word [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Recently, Fici, Restivo, Silva, and Zamboni introduced the notion of a $k$-anti-power, which is defined as a word of the form $w^{(1)} w^{(2)} \cdots w^{(k)}$, where $w^{(1)}, w^{(2)}, \ldots, w^{(k)}$ are distinct words of the same length.
Marisa Gaetz
doaj +1 more source