Results 61 to 70 of about 2,755,381 (193)
Analysis of concurrent algorithms
DAIMI Report Series, 1981 Analyzing the running time of a concurrent algorithm can be as important as verifying its partial correctness or termination. A simple technique for analyzing the running time of a concurrent algorithm is presented. To analyze an algorithm with concurrent processes, the interaction between the processes must be considered.
openaire +2 more sources
Average case analysis of marking algorithms [PDF]
, 1984 The Lindstrom marking algorithm uses bounded workspace. Its time complexity is O(n^2) in all cases, but it has been assumed that the average case time complexity O(n lg n). It is proven that the average case time complexity is H(n^2).
Hirschberg, D. S., Larmore, L. L.
core +1 more source
Non-ergodic Convergence Analysis of Heavy-Ball Algorithms
, 2018 In this paper, we revisit the convergence of the Heavy-ball method, and present improved convergence complexity results in the convex setting. We provide the first non-ergodic O(1/k) rate result of the Heavy-ball algorithm with constant step size for ...
Guan, Lei +5 more
core +1 more source
Scheduling Policies in Time and Frequency Domains for LTE Downlink Channel: A Performance Comparison [PDF]
, 2017 A key feature of the Long-Term Evolution (LTE) system is that the packet scheduler can make use of the channel quality information (CQI), which is periodically reported by user equipment either in an aggregate form for the whole downlink channel or ...
Carpin, Mattia +5 more
core +1 more source
A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Guy Louchard, Helmut Prodinger
doaj +1 more source
Modular design of data-parallel graph algorithms [PDF]
, 2013 Amorphous Data Parallelism has proven to be a suitable vehicle for implementing concurrent graph algorithms effectively on multi-core architectures.
Christianson, B. +2 more
core +1 more source
Sequential selection of the k best out of nrankable objects [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 The objective of this paper is to find in a setting of n sequential observations of objects a good online policy to select the k bestof these n uniquely rankable objects.
F. Thomas Bruss, Guy Louchard
doaj +1 more source
Persisting randomness in randomly growing discrete structures: graphs and search trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values.
Rudolf Grübel
doaj +1 more source
Formal Analysis of Online Algorithms [PDF]
, 2011 In [2], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in R≥0.
Benjamin Aminof +2 more
openaire +1 more source
Convergence Analysis of the FOCUSS Algorithm
IEEE Transactions on Neural Networks and Learning Systems, 2015 FOCal Underdetermined System Solver (FOCUSS) is a powerful tool for sparse representation and underdetermined inverse problems, which is extremely easy to implement. In this paper, we give a comprehensive convergence analysis on the FOCUSS algorithm towards establishing a systematic convergence theory by providing three primary contributions as follows.
He, Zhaoshui +2 more
openaire +3 more sources