Results 41 to 50 of about 2,755,381 (193)
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
The Adaptive sampling revisited [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 The problem of estimating the number n of distinct keys of a large collection of N data is well known in computer science. A classical algorithm is the adaptive sampling (AS).
Matthew Drescher +2 more
doaj +1 more source
Analysis of Steiner subtrees of Random Trees for Traceroute Algorithms [PDF]
, 2008 We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A subset of nodes is selected according to some criterion. As a measure of efficiency of
Athreya +11 more
core +4 more sources
Protected node profile of Tries [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 In a rooted tree, protected nodes are neither leaves nor parents of any leaves. They have some practical motivations, e.g., in organizational schemes, security models and social-network models.
Mehri Javanian
doaj +1 more source
Analysis of a Cooperative Stereo Algorithm [PDF]
Biological Cybernetics, 1978 Marr and Poggio (1976) recently described a cooperative algorithm that solves the correspondence problem for stereopsis. This article uses a probabilistic technique to analyze the convergence of that algorithm, and derives the conditions governing the stability of the solution state.
Marr, D., Palm, G., Poggio, T.
openaire +3 more sources
Quantization in Control Systems and Forward Error Analysis of Iterative Numerical Algorithms [PDF]
, 2010 The use of control theory to study iterative algorithms, which can be considered as dynamical systems, opens many opportunities to find new tools for analysis of algorithms.
Constantinides, GA +2 more
core +2 more sources
Fourier Analysis of Genetic Algorithms
Theoretical Computer Science, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kosters, Walter A. +2 more
openaire +1 more source
Spectral analysis of phase shifting algorithms [PDF]
Optics Express, 2009 Systematic spectral analysis of Phase Shifting Interferometry (PSI) algorithms was first proposed in 1990 by Freischlad and Koliopoulos (F&K). This analysis was proposed with the intention that "in a glance" the main properties of the PSI algorithms would be highlighted.
Quiroga Mellado, Juan Antonio +2 more
openaire +3 more sources
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