Results 41 to 50 of about 174,873,121 (310)
Arithmetics in β-numeration [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Julien Bernat
doaj +1 more source
Analysis of Algorithms and Partial Algorithms [PDF]
, 2016 We present an alternative methodology for the analysis of algorithms, based on the concept of expected discounted reward. This methodology naturally handles algorithms that do not always terminate, so it can (theoretically) be used with partial algorithms for undecidable problems, such as those found in artificial general intelligence (AGI) and ...
openaire +3 more sources
Bias-variance decomposition in Genetic Programming
Open Mathematics, 2016 We study properties of Linear Genetic Programming (LGP) through several regression and classification benchmarks. In each problem, we decompose the results into bias and variance components, and explore the effect of varying certain key parameters on the
Kowaliw Taras, Doursat René
doaj +1 more source
An Algorithm to Compute the Character Access Count Distribution for Pattern Matching Algorithms
Algorithms, 2011 We propose a framework for the exact probabilistic analysis of window-based pattern matching algorithms, such as Boyer–Moore, Horspool, Backward DAWG Matching, Backward Oracle Matching, and more.
Sven Rahmann, Tobias Marschall
doaj +1 more source
Analysis of some parameters for random nodes in priority trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analysis of ...
Alois Panholzer
doaj +1 more source
The sparse awakens : streaming algorithms for matching size estimation in sparse graphs [PDF]
, 2017 Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models.
Muthukrishnan, S. +3 more
core +1 more source
Asymptotics of the occupancy scheme in a random environment and its applications to tries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Consider $ m $ copies of an irreducible, aperiodic Markov chain $ Y $ taking values in a finite state space. The asymptotics as $ m $ tends to infinity, of the first time from which on the trajectories of the $ m $ copies differ, have been studied by ...
Silvia Businger
doaj +1 more source
Mind the O˜: Asymptotically Better, but Still Impractical, Quantum Distributed Algorithms
, 2023 We present two algorithms in the quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability: one for producing an approximately optimal Steiner tree, and one for producing an exact directed minimum spanning tree, each of ...
David E. Bernal Neira +3 more
core +1 more source
The Variance of the Profile in Digital Search Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Analysis of ...
Ramin Kazemi, Mohammad Q. Vahidi-Asl
doaj +1 more source
Link Evolution: Analysis and Algorithms [PDF]
Internet Mathematics, 2004 The main purpose of this interesting paper is to point out the increasing importance of the evolutionary computing approach to the future web search algorithms and information retrieval techniques. As a specific aim, this article presents an efficient algorithm that computes incrementally good approximations to Google's PageRank [S. Brin, L. Page (1998)
Chien, Steve +4 more
openaire +2 more sources