Results 31 to 40 of about 818,608 (269)
Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Analysis of ...
Valerie Berthe, Laurent Imbert
doaj +1 more source
On-line extensible bin packing with unequal bin sizes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Analysis of ...
Deshi Ye, Guochuan Zhang
doaj +1 more source
Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Analysis of ...
Gregory Nuel
doaj +1 more source
A Didactic Analysis of Functional Queues
Informatics in Education, 2011 When first introduced to the analysis of algorithms, students are taught how to assess the best and worst cases, whereas the mean and amortized costs are considered advanced topics, usually saved for graduates.
Christian RINDERKNECHT
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 +2 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
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
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
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