نتایج جستجو برای: probabilistic analysis
تعداد نتایج: 2872550 فیلتر نتایج به سال:
A guarantee is only as good as its assumptions. Three group membership areas defy firm, practical guarantees: transient faults, reintegration, and large groups. We show why these areas are problematic, discuss current approaches, and illustrate alternative approaches that may lead to a more dependable system. Ultimately, designs should be tested against a comprehensive fault model, and a probab...
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
We give a probabilistic analysis of parameters related to α-gapped repeats and palindromes in random words, under both uniform and memoryless distributions (where letters have different probabilities, but are drawn independently). More precisely, we study the expected number of maximal α-gapped patterns, as well as the expected length of the longest α-gapped pattern in a random word. 1998 ACM S...
Motivated by a recent paper by Cichoń and Macyna [1], who introduced m counters (instead of just one) in the approximate counting scheme first analysed by Flajolet [2], we analyse the moments of the sum of the m counters, using techniques that proved to be successful already in several other contexts [11].
vi Chapter 1 Three Algorithmic Concerns 1 1.
We do a probabilistic analysis of the problem of distributing a single piece of information to the vertices of a graph G. Assuming that the input graph G is Gn,p, we prove an O(lnn/n) upper bound on the edge density needed so that with high probability the information can be broadcast in ⌈log2 n⌉ rounds.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید