Sciweavers

1329 search results - page 155 / 266
» Randomly Sampling Molecules
Sort
View
COMPGEOM
1994
ACM
15 years 6 months ago
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
Pankaj K. Agarwal, Mark de Berg, Jirí Matou...
109
Voted
VMV
2004
123views Visualization» more  VMV 2004»
15 years 3 months ago
Hierarchy Accelerated Stochastic Collision Detection
In this paper we present a new framework for collision and self-collision detection for highly deformable objects such as cloth. It permits to efficiently trade off accuracy for s...
Stefan Kimmerle, Matthieu Nesme, François F...
114
Voted
WSC
2004
15 years 3 months ago
Make-to-Stock Systems with Backorders: IPA Gradients
We consider single-stage, single-product Make-to-Stock systems with random demand and random service (production) rate, where demand shortages at the inventory facility are backor...
Yao Zhao, Benjamin Melamed
AIPS
2009
15 years 3 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
114
Voted
CORR
2010
Springer
134views Education» more  CORR 2010»
15 years 2 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli