Probabilistic analysis of some distributed algorithms
نویسندگان
چکیده
منابع مشابه
A Probabilistic Analysis of Some Tree Algorithms
INRIA In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to the usual complex analysis techniques. This approach gives a unified probabilistic treatment of these questions. It simplifies and ex...
متن کاملA Probabilistic Analysis of Some Tree Algorithms
Abstract. In this paper a general class of tree algorithms is analyzed. It is shown that, by using an appropriate probabilistic representation of the quantities of interest, the asymptotic behavior of these algorithms can be obtained quite easily without resorting to complex analysis techniques as it is usually the case. This approach gives a unified probabilistic treatment of these questions. ...
متن کاملDistributed randomized algorithms for probabilistic performance analysis
Randomized algorithms are a useful tool for analyzing the performance of complex uncertain systems. Their implementation requires the generation of a large number N of random samples representing the uncertainty scenarios, and the corresponding evaluation of system performance. When N is very large and/or performance evaluation is costly or time consuming, it can be necessary to distribute the ...
متن کاملOn some conditioning results in the probabilistic analysis of algorithms
A key step in the probabilistic analysis of combinatorial algorithms is often that of establishing that certain conditioning introduced by the operation so far of the algorithm either helps or at least does not hurt too much. In this note we consider a conditioning problem that arises from searching adjacency lists, and which occurs for example in the analysis of algorithms for finding Hamilton...
متن کاملProbabilistic Analysis of Algorithms
Rather than analyzing the worst case performance of algorithms, one can investigate their performance on typical instances of a given size. This is the approach we investigate in this paper. Of course, the first question we must answer is: what do we mean by a typical instance of a given size? Sometimes, there is a natural answer to this question. For example, in developing an algorithm which i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 1991
ISSN: 1042-9832
DOI: 10.1002/rsa.3240020203