Results 261 to 270 of about 52,526 (306)
Some of the next articles are maybe not open access.
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 Disjoint Set Union Algorithms
SIAM Journal on Computing, 1993The Union-Find problem of \textit{A. V. Aho, J. E. Hopcroft} and \textit{J. D. Ullman} [The design and analysis of computer algorithms, Addison-Wesley Publ. Comp. (1974; Zbl 0326.68005)] consists of maintaining a representation of a partion of an \(n\)-set, where the operations are Find and Union. This problem arises in several applications.
Bollabás, Béla, Simon, Istvan
openaire +1 more source
Probabilistic analysis of a grouping algorithm
Algorithmica, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wong, D. F., Reingold, Edward M.
openaire +2 more sources
Probabilistic analysis of approximation algorithms
1999IN PREVIOUS chapters the performance of an approximate algorithm has been analyzed using a worst case point of view. In this chapter this condition is relaxed and the probabilistic analysis of an algorithm is performed by considering either the average case or the behavior in almost all cases.
Giorgio Ausiello +5 more
openaire +1 more source
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms, 2002AbstractOn input a random 3‐CNF formula of clauses‐to‐variables ratior3applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of clauses, irrespective of their size and the number of occurrences of the negation of the literal (ties are broken randomly; 1‐clauses when they appear get priority).
Kaporis, Alexis C. +2 more
openaire +1 more source
Probabilistic analysis of bandwidth minimization algorithms
Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83, 1983We study the probabilistic performance of heuristic algorithms for the NP-complete bandwidth minimization problem. Let (equation) be a graph with (equation). Define the bandwidth of G by (equation) where t ranges over all permutations on V. Let A be a bandwidth minimization algorithm and let A (G) denote the bandwidth of the layout produced by A on the
openaire +1 more source
Probabilistic complexity analysis of incremental DFT algorithms
1997 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2002We present a probabilistic complexity analysis of a class of multi-stage algorithms for computing successive approximations to the DFT. While the quality of the approximate spectra obtained after any stage of these algorithms can be readily quantified in terms of commonly used input-independent metrics of spectral quality, each stage's arithmetic ...
J.M. Winograd, S.H. Nawab
openaire +1 more source
Probabilistic Analysis of Online Stacking Algorithms
2015Consider the situation where some items arrive to a storage location where they are temporarily stored in bounded capacity LIFO stacks until their departure. We consider the problem of deciding where to put an arriving item with the objective of using as few stacks as possible.
Olsen, Martin, Gross, Allan
openaire +3 more sources
Probabilistic analysis of a bin covering algorithm
Operations Research Letters, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Han, Sunan +2 more
openaire +2 more sources