Andere Kunden interessierten sich auch für
![Convex Bodies]( "Convex Bodies")
Convex Bodies152,99 €![The Hyperbolic Curve and the Law of Progression of Rotating Bodies]( "The Hyperbolic Curve and the Law of Progression of Rotating Bodies")
The Hyperbolic Curve and the Law of Progression of Rotating Bodies28,99 €![Convex and Concave Polygons]( "Convex and Concave Polygons")
Convex and Concave Polygons22,99 €![Convex Hull Algorithms]( "Convex Hull Algorithms")
Convex Hull Algorithms22,99 €![Convex Cone]( "Convex Cone")
Convex Cone22,99 €![Convex Polytope]( "Convex Polytope")
Convex Polytope22,99 €![Convex Metric Space]( "Convex Metric Space")
Convex Metric Space19,99 €
High Quality Content by WIKIPEDIA articles! High Quality Content by WIKIPEDIA articles! The paper is a joint work by Martin Dyer, Alan M. Frieze and Ravindran Kannan. The main result of the paper is a randomized algorithm for finding an approximation to the volume of a convex body K in n-dimensional Euclidean space by assume the existence of a membership oracle. The algorithm takes time bounded by a polynomial in n, the dimension of K and 1 / . The algorithm is a sophisticated usage of the so-called Markov chain Monte Carlo (MCMC) method. The basic scheme of the algorithm is a nearly uniform sampling from within K by placing a grid consisting n-dimensional cubes and doing a random walk over these cubes. By using the theory of rapidly mixing Markov chains, they show that it takes a polynomial time for the random walk to settle down to being a nearly uniform distribution.