Results 291 to 300 of about 380,355 (349)

Probabilistic Analysis of Algorithms

1998
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?
Bruce H. Reed, Alan Frieze
openaire   +3 more sources

Algorithms for Packing Squares: A Probabilistic Analysis

SIAM Journal on Computing, 1989
Two variations of two-dimensional problem of packing square objects are considered: strip packing and bin packing. The strip packing problem is to pack the squares into a strip of width 1 so as to minimize the span of the packing. The bin-packing problem is to pack squares into square bins of size 1 so as to minimize the number of bins.
Edward G. Coffman, Jeffrey C. Lagarias
openaire   +4 more sources

Probabilistic analysis of bandwidth minimization algorithms

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83, 1983
We 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
J. Turner
openaire   +3 more sources

Probabilistic analysis of algorithms and data structures

Workshop on Algorithms and Data Structures, 1989
L. Devroye
openaire   +3 more sources

A dynamic probabilistic analysis method for wind turbines rotor based on the surrogate model

Journal of Renewable and Sustainable Energy, 2023
Due to the long and flexible characteristics of the wind turbine blade, the influence of fluid-structure interaction on the dynamic response results cannot be ignored.
Ruixing Zhang, Lun He, L. An
semanticscholar   +1 more source

Probabilistic analysis of a grouping algorithm

Algorithmica, 1991
We study thegrouping by swapping problem, which occurs in memory compaction and in computing the exponential of a matrix. In this problem we are given a sequence ofn numbers drawn from {0,1, 2,...,m−1} with repetitions allowed; we are to rearrange them, using as few swaps of adjacent elements as possible, into an order such that all the like numbers ...
D. F. Wong, Edward M. Reingold
openaire   +2 more sources

Probabilistic analysis of a bin covering algorithm

Operations Research Letters, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joseph Y.-T. Leung, Dawei Hong, Sunan Han   +2 more
openaire   +3 more sources

On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms

Symbolic-Numeric Computation, 2007
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values.
E. Kaltofen, Zhengfeng Yang, L. Zhi
semanticscholar   +1 more source

Should I Follow the Crowd?: A Probabilistic Analysis of the Effectiveness of Popularity in Recommender Systems

Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, 2018
The use of IR methodology in the evaluation of recommender systems has become common practice in recent years. IR metrics have been found however to be strongly biased towards rewarding algorithms that recommend popular items "the same bias that state of
Rocío Cañamares, P. Castells
semanticscholar   +1 more source

Probabilistic Tools for the Analysis of Randomized Optimization Heuristics

Theory of Evolutionary Computation, 2018
This chapter collects several probabilistic tools that have proven to be useful in the analysis of randomized search heuristics. This includes classic material such as the Markov, Chebyshev, and Chernoff inequalities, but also lesser-known topics such as
Benjamin Doerr
semanticscholar   +1 more source