Sciweavers

1236 search results - page 152 / 248
» On the Hamkins approximation property
Sort
View
NIPS
2001
15 years 7 months ago
Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
Evan Greensmith, Peter L. Bartlett, Jonathan Baxte...
VMV
2004
80views Visualization» more  VMV 2004»
15 years 7 months ago
Memory Efficient Billboard Clouds for BTF Textured Objects
Efficiently rendering highly structured models distant from the viewer constitutes a difficult task since the geometric complexity has to be reduced extremely while simultaneously...
Jan Meseth, Reinhard Klein
SMA
2010
ACM
181views Solid Modeling» more  SMA 2010»
15 years 6 months ago
Merging and smoothing machining boundaries on cutter location surfaces
In region machining, neighbouring regions may be close together, but disconnected. Boundary curves may also have unwanted geometric artifacts caused by approximation and discretis...
Weishi Li, Ralph R. Martin, Frank C. Langbein
ALGORITHMICA
2007
114views more  ALGORITHMICA 2007»
15 years 6 months ago
The Consecutive Ones Submatrix Problem for Sparse Matrices
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
Jinsong Tan, Louxin Zhang
IJRR
2008
115views more  IJRR 2008»
15 years 6 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin