Pages that link to "Item:Q3345655"
From MaRDI portal
The following pages link to Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions (Q3345655):
Displaying 50 items.
- Pairwise comparison tables within the deck of cards method in multiple criteria decision aiding (Q2030731) (← links)
- A Metropolis-class sampler for targets with non-convex support (Q2058894) (← links)
- Oracle lower bounds for stochastic gradient sampling algorithms (Q2137007) (← links)
- Efficient sampling in spectrahedra and volume approximation (Q2144244) (← links)
- \(t\)-copula from the viewpoint of tail dependence matrices (Q2146466) (← links)
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
- Multiple criteria decision aiding as a prediction tool for migration potential of regions (Q2178151) (← links)
- Efficient computation of the stochastic behavior of partial sum processes (Q2184415) (← links)
- A robust hierarchical nominal multicriteria classification method based on similarity and dissimilarity (Q2189892) (← links)
- Hit and run as a unifying device (Q2197359) (← links)
- Efficient uncertainty quantification with the polynomial chaos method for stiff systems (Q2271597) (← links)
- Research on probabilistic methods for control system design (Q2276096) (← links)
- As simple as possible but not simpler in multiple criteria decision aiding: the robust-stochastic level dependent Choquet integral approach (Q2327636) (← links)
- Multinomial models with linear inequality constraints: overview and improvements of computational methods for Bayesian inference (Q2332837) (← links)
- A coherent approach to Bayesian data envelopment analysis (Q2333021) (← links)
- An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
- Improving hit-and-run for global optimization (Q2366968) (← links)
- Derivative-free optimization: a review of algorithms and comparison of software implementations (Q2392129) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- Qualitative chain graphs and their application (Q2440183) (← links)
- An analytically derived cooling schedule for simulated annealing (Q2460137) (← links)
- Solving fractional problems with dynamic multistart improving hit-and-run (Q2468758) (← links)
- Generation of classes of robust periodic railway timetables (Q2489288) (← links)
- A soft approach for hard continuous optimization (Q2491765) (← links)
- Evaluation of nondominated solution sets for \(k\)-objective optimization problems: an exact method and approximations (Q2496079) (← links)
- Generating a random collection of discrete joint probability distributions subject to partial information (Q2513651) (← links)
- Stochastic multiobjective acceptability analysis for the Choquet integral preference model and the scale construction problem (Q2629611) (← links)
- Single observation adaptive search for discrete and continuous stochastic optimization (Q2661541) (← links)
- Sampling from the complement of a polyhedron: an MCMC algorithm for data augmentation (Q2661558) (← links)
- Exploiting sparsity for semi-algebraic set volume computation (Q2696572) (← links)
- Multiobjective Interacting Particle Algorithm for Global Optimization (Q2940537) (← links)
- Approximating Joint Probability Distributions Given Partial Information (Q2960223) (← links)
- A Simulation-Based Approach to Decision Making with Partial Information (Q2960232) (← links)
- Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740) (← links)
- A weighted belief-propagation algorithm for estimating volume-related properties of random polytopes (Q3301299) (← links)
- Volume estimation by monte carlo methods<sup>*</sup> (Q3352366) (← links)
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes (Q3452552) (← links)
- Stochastic Billiards for Sampling from the Boundary of a Convex Set (Q3465938) (← links)
- Pure Random Search with exponential rate of convergency (Q3553768) (← links)
- HOW TO GENERATE UNIFORM SAMPLES ON DISCRETE SETS USING THE SPLITTING METHOD (Q3585151) (← links)
- Short-run characteristics of samples drawn by random walks (Q3711718) (← links)
- (Q4558208) (← links)
- Comparison of hit-and-run, slice sampler and random walk Metropolis (Q4611278) (← links)
- Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints (Q4674254) (← links)
- A Generalized Sampling Approach for Multilinear Utility Functions Given Partial Preference Information (Q4691976) (← links)
- Estimating Latent Processes on a Network From Indirect Measurements (Q4916935) (← links)
- Robust Optimization with Ambiguous Stochastic Constraints Under Mean and Dispersion Information (Q4971381) (← links)
- Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule (Q4975420) (← links)
- ELECTRE Methods: A Survey on Roman Słowiński Contributions (Q5049387) (← links)
- Entanglement in bipartite quantum systems: Euclidean volume ratios and detectability by Bell inequalities (Q5051657) (← links)
