Results 281 to 290 of about 1,094,599 (317)
Some of the next articles are maybe not open access.
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
An analysis of Atkinson's algorithm
ACM SIGSAM Bulletin, 1992An algorithm for computing a minimal invariant partition of a permutation group due to Atkinson is analysed. The analysis shows the algorithm is O ( n 2 ), where n is the degree of the group. The leading coefficient is 3/2. Some suggested speed-ups are also
openaire +1 more source
Sensitivity analysis of scheduling algorithms
European Journal of Operational Research, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Penz, Bernard +2 more
openaire +3 more sources
Analysis of the Brun Gcd Algorithm
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016We introduce and study a multiple gcd algorithm that is a natural extension of the usual Euclid algorithm, and coincides with it for two entries; it performs Euclidean divisions, between the largest entry and the second largest entry, and then re-orderings. This is the discrete version of a multidimensional continued fraction algorithm due to Brun.
Berthé, Valérie +2 more
openaire +1 more source
Experimental Analysis of Algorithms
2002Summary: This article presents examples from broad research efforts in experimental algorithmics: first, to develop accurate models of computation that allow closer predictions of performance, and second, to extend abstract analyses beyond traditional questions and assumptions.
openaire +2 more sources
ANALYSIS AND ALGORITHMS OF BIFUZZY SYSTEMS
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2004A fuzzy variable is a function from a possibility space to the set of real numbers, while a bifuzzy variable is a function from a possibility space to the set of fuzzy variables. In this paper, a concept of chance distribution is originally presented for bifuzzy variable, and the linearity of expected value operator of bifuzzy variable is proved ...
Jian Zhou 0003, Baoding Liu
openaire +1 more source
Analysis of an Infinite Product Algorithm
SIAM Journal on Discrete Mathematics, 1989If \(w\) is a binary word (i.e. an element of \(\{0,1\}^*)\), let \(a_ w(n)\) denote the number of possibly overlapping occurrences of \(w\) in the binary expansion of the integer \(n\). In a recent paper [J. Lond. Math. Soc., II. Ser. 39, 193--204 (1989; Zbl 0629.05004)] \textit{J.-P. Allouche} and \textit{J. Shallit} showed that for every \(w\) there
Jean-Paul Allouche +2 more
openaire +2 more sources
Convergence Analysis of Stochastic Algorithms
Mathematics of Operations Research, 1996This paper investigates asymptotic convergence to stationary points of gradient descent algorithms where the functions involved are not available in closed form but are approximated by sequences of random functions. The algorithms take large stepsizes and use progressively finer precision at successive iterations.
Alexander Shapiro 0001, Yorai Wardi
openaire +2 more sources
On the Analysis and Synthesis of VLSI Algorithms
IEEE Transactions on Computers, 1982This correspondence is concerned with the development of algorithms for special-purpose VLSI arrays. The approach used in this correspondence is to identify algorithm transformations which modify favorably the index set and the data dependences, but perserve the ordering imposed on the index set by the data dependences.
openaire +2 more sources