Pages that link to "Item:Q2490265"
From MaRDI portal
The following pages link to Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265):
Displaying 50 items.
- Randomized interior point methods for sampling and optimization (Q259600) (← links)
- A practical volume algorithm (Q298158) (← links)
- A parallel implementation of an \(O^\ast(n^4)\) volume algorithm (Q302146) (← links)
- Exploring stochasticity and imprecise knowledge based on linear inequality constraints (Q314508) (← links)
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm (Q421722) (← links)
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes (Q784479) (← links)
- Approximating the stability region for binary mixed-integer programs (Q833592) (← links)
- Dispersion of mass and the complexity of randomized geometric algorithms (Q947778) (← links)
- Extended studies of separability functions and probabilities and the relevance of Dyson indices (Q950261) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- Calculating the free energy of nearly jammed hard-particle packings using molecular dynamics (Q996517) (← links)
- Optimization of a convex program with a polynomial perturbation (Q1043242) (← links)
- Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
- Improved mixing rates of directed cycles by added connection (Q1741874) (← links)
- Efficient approximation schemes for economic lot-sizing in continuous time (Q1751154) (← links)
- Mass volume curves and anomaly ranking (Q1786577) (← links)
- Hitting time of quantum walks with perturbation (Q1937291) (← links)
- Markov chains, Hamiltonian cycles and volumes of convex bodies (Q1945510) (← links)
- Large margin vs. large volume in transductive learning (Q2036258) (← links)
- Approximate weighted model integration on DNF structures (Q2082501) (← links)
- Floating bodies and approximation of convex bodies by polytopes (Q2135725) (← links)
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
- Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions: continuous dynamics (Q2240875) (← links)
- Improved approximations for the Erlang loss model (Q2269482) (← links)
- Mixing time of an unaligned Gibbs sampler on the square (Q2274312) (← links)
- Estimating the volume of solution space for satisfiability modulo linear real arithmetic (Q2345986) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions (Q2443195) (← links)
- A dynamic programming approach to efficient sampling from Boltzmann distributions (Q2517788) (← links)
- Randomly coloring constant degree graphs (Q2852546) (← links)
- Multiobjective Interacting Particle Algorithm for Global Optimization (Q2940537) (← links)
- An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths (Q2980930) (← links)
- The Computational Complexity of Estimating MCMC Convergence Time (Q3088115) (← links)
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes (Q3452552) (← links)
- Random Instances of Problems in NP – Algorithms and Statistical Physics (Q3464473) (← links)
- Stochastic Billiards for Sampling from the Boundary of a Convex Set (Q3465938) (← links)
- Sampling Hypersurfaces through Diffusion (Q3541818) (← links)
- (Q4558208) (← links)
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume (Q4571932) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- (Q4637035) (← links)
- Using Histograms to Better Answer Queries to Probabilistic Logic Programs (Q4649723) (← links)
- Practical Volume Estimation of Zonotopes by a New Annealing Schedule for Cooling Convex Bodies (Q5039574) (← links)
- Entanglement in bipartite quantum systems: Euclidean volume ratios and detectability by Bell inequalities (Q5051657) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids (Q5170985) (← links)
- Honey from the Hives: A Theoretical and Computational Exploration of Combinatorial Hives (Q5857708) (← links)
- Strong dispersion property for the quantum walk on the hypercube (Q5878957) (← links)
- On the mixing time of coordinate Hit-and-Run (Q5886322) (← links)
