Results 271 to 280 of about 52,526 (306)
Some of the next articles are maybe not open access.
Probabilistic Analysis of Graph Algorithms
1990Probabilistic Analysis of Graph Algorithms. We review some of the known results on the average case performance of graph algorithms. The analysis assumes that the problem instances are randomly selected from some reasonable distribution of problems. We consider two types of problem.
openaire +1 more source
Probabilistic analysis of graph colouring algorithms
1983In this paper we analyze algorithms for the graph colouring problem from a probabilistic point of view. Furthermore we show that the chromatic number of a graph converges to n log 1/q / 2 log n almost surely.
A. Marchetti-Spaccamela, M. Talamo
openaire +1 more source
Probabilistic analysis of k-dimensional packing algorithms
Information Processing Letters, 1995In the k-dimensional packing problem, we are given a set I = b1, b2,…, bn of k-dimensional boxes and a k-dimensional box B with unit length in each of the first k − 1 dimensions and unbounded length in the kth dimension. Each box bi is represented by a k-tuplebi = (xi(1),…, xi(k − 1), xi(k)) ϵ (0, 1]k − 1 × (0, ∞), where x(j) denotes its length in the ...
Dawei Hong, Joseph Y-T. Leung
openaire +1 more source
Probabilistic language analysis of weighted voting algorithms
ACM SIGMETRICS Performance Evaluation Review, 1990We present a method of analyzing the performance of weighted voting algorithms in a fault-tolerant distributed system. In many distributed systems, some processors send messages more frequently than others and all processors share a common communication medium, such as an Ethernet. Typical fault-tolerant voting algorithms require that a certain minimum
Louise E. Moser +2 more
openaire +1 more source
A Probabilistic Analysis of Christofides’ Algorithm
2012Christofides' algorithm is a well known approximation algorithm for the metric travelling salesman problem. As a first step towards obtaining an average case analysis of Christofides' algorithm, we provide a probabilistic analysis for the stochastic version of the algorithm for the Euclidean traveling salesman problem, where the input consists of n ...
Markus Bläser +2 more
openaire +1 more source
Probabilistic analysis of shelf algorithms for strip packing
Discrete Mathematics and Applications, 2006Summary: In this paper, we consider algorithms to pack rectangles into a strip. As the main result we present an algorithm that packs rectangles online and for which the ratio of expected wasted area to expected occupied area tends to zero as the number of rectangles increases.
Kuzyurin, N. N., Pospelov, A. I.
openaire +1 more source
Probabilistic Analysis of Knapsack Core Algorithms
2004We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called {\em core algorithms}, the predominant algorithmic concept used in practice. These algorithms start with the computation of an optimal fractional solution that has only one fractional item and then they exchange items until ...
Beier, R., Vöcking, B.
openaire +1 more source
Probabilistic Analysis of Algorithms for NP-Complete Problems.
1983Abstract : The goal of this research is to develop and analyze algorithms which can, in some practical sense, solve certain NP-complete problems efficiently. By solve we mean determine whether a solution to a given instance of an NP-complete problem exists where, for the problems we have considered, a solution is an assignment of values to a list of ...
openaire +1 more source
Noisy intermediate-scale quantum algorithms
Reviews of Modern Physics, 2022Kishor Bharti +2 more
exaly