Results 151 to 160 of about 2,755,381 (193)
Some of the next articles are maybe not open access.
Analysis of a shellsort algorithm
BIT, 1973D. L. Shell published in 1959, [4], a fast algorithm for internal sorting. R. M. Frank and R. B. Lazarus pointed out in 1960, [3], a disadvantage in the original design of the algorithm and changes were proposed based on heuristic arguments. J. Boothroyd took care of Frank and Lazarus objections in an elegant algorithm published 1963, [1]. If we change
openaire +2 more sources
Empirical Analysis of Randomized Algorithms
2007Heuristic algorithms are often difficult to analyse theoretically; this holds in particular for advanced, randomised algorithms that perform well in practice, such as high-performance stochastic local search (SLS) procedures (also known as metaheuristics) [1]. Furthermore, for various reasons, the practical applicability of the theoretical results that
Hoos, Holger H., Stützle, Thomas
openaire +1 more source
Dynamical analysis of α-Euclidean algorithms
Journal of Algorithms, 2002no ...
Bourdon, Jérémie +2 more
openaire +2 more sources
Algorithmic analysis of multithreaded algorithms
1997Cilk is a parallel programming language that allows programmers to write multithreaded parallel programs that use computational resources predictably and efficiently. The Cilk language allows programmers to specify the interactions among computational threads in a high-level fashion, and then Cilk's runtime system maps the computation onto available ...
openaire +1 more source
Algorithmic Analysis of the Pseudoanalytic Cryptographic Algorithm
2014In order to protect the information, the study and development of a new cryptographic method is a hard duty, due to the high amount of techniques to decrypt and obtain the information; this works is fully dedicated to analyse the run time of the cipher method employing the Pseudoanalytic Function Theory. The main purpose of this work, is to analyse the
Ariana Guadalupe Bucio Ramirez +3 more
openaire +1 more source
PROBABILISTIC ANALYSIS OF ALGORITHMS
1985An introductory and selective review is presented of results obtained through a probabilistic analysis of combinatorial algorithms. The emphasis is on asymptotic characteristics of optimal solution values, and on the relative and absolute error analysis for simple heuristics.
Rinnooy Kan, A. H. G. +1 more
openaire +1 more source
Probabilistic Analysis of Algorithms
1982This paper is a brief introduction to the field of probabilistic analysis of algorithms; it is not a comprehensive survey. The first part of the paper examines three important probabilistic algorithms that together illustrate many of the important points of the field, and the second part then generalizes from those examples to provide a more systematic
Jon Louis Bentley, George S. Lueker
openaire +1 more source
Analysis of Clustering Algorithms
2016Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in some sense or another) to each other than to those in other groups (clusters). It is a main task of exploratory data mining, and a common technique for statistical data analysis, used in many ...
Iryna Zheliznyak +2 more
openaire +1 more source
Probabilistic Analysis of Algorithms
1998Rather 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?
Alan M. Frieze, Bruce Reed
openaire +1 more source