Pages that link to "Item:Q3339156"
From MaRDI portal
The following pages link to Generating random points in a polytope (Q3339156):
Displaying 17 items.
- An economical acceptance-rejection algorithm for uniform random variate generation over constrained simplexes (Q294251) (← links)
- Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes (Q666374) (← links)
- Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull (Q814963) (← links)
- Uniform distributions in a class of convex polyhedrons with applications to drug combination studies (Q1026371) (← links)
- Simulation of polyhedral convex contoured distributions (Q1690449) (← links)
- Generating random polygons with given vertices (Q1924712) (← links)
- Generating a random collection of discrete joint probability distributions subject to partial information (Q2513651) (← links)
- Random generation of \(Q\)-convex sets (Q2576884) (← links)
- Generating random points in a tetrahedron (Q2775704) (← links)
- Generating equilateral random polygons in confinement. II (Q2901852) (← links)
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions (Q3345655) (← links)
- Few points to generate a random polytope (Q4384734) (← links)
- Generating uniform random points inside a cone (Q4504227) (← links)
- A Generalized Sampling Approach for Multilinear Utility Functions Given Partial Preference Information (Q4691976) (← links)
- Generating triangulations at random (Q4876039) (← links)
- Random generation of \(k\)-interactive capacities (Q6057910) (← links)
- Random generation of capacities and its application in comprehensive decision aiding (Q6066177) (← links)
