Results 21 to 30 of about 174,873,121 (310)
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
Approximation result toward nearest neighbor heuristic [PDF]
Yugoslav Journal of Operations Research, 2002 In this paper, we revisit the famous heuristic called nearest neighbor (N N) for the traveling salesman problem under maximization and minimization goal.
Monnot Jér"me
doaj +1 more source
On non-adaptive majority problems of large query size [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We are given $n$ balls and an unknown coloring of them with two colors. Our goal is to find a ball that belongs to the larger color class, or show that the color classes have the same size.
Dániel Gerbner, Máté Vizer
doaj +1 more source
Quicksort algorithm again revisited [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 We consider the standard Quicksort algorithm that sorts n distinct keys with all possible n! orderings of keys being equally likely. Equivalently, we analyze the total path length L(n) in a randomly built \emphbinary search tree.
Charles Knessl, Wojciech Szpankowski
doaj +1 more source
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
Comparative Analysis of Load Balancing Algorithms for Efficient Task Scheduling in Cloud Computing [PDF]
, 2023 : In the field of information technology cloud computing is a recently developed technology. In such a complicated system, an effective load balancing scheme is critical in order to meet peak user demands and deliver high-quality services. Load balancing
Yazeed Al Moayed, Sawsan Rabaya
core +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
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