Sciweavers

16188 search results - page 96 / 3238
» The Optimal PAC Algorithm
Sort
View
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
14 years 11 months ago
A fast n-dimensional ray-shooting algorithm for grasping force optimization
We present an efficient algorithm for solving the ray-shooting problem on high dimensional sets. Our algorithm computes the intersection of the boundary of a compact convex set w...
Yu Zheng, Ming C. Lin, Dinesh Manocha
APPROX
2005
Springer
136views Algorithms» more  APPROX 2005»
15 years 6 months ago
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
IJCAI
2001
15 years 1 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
88
Voted
CEC
2009
IEEE
15 years 7 months ago
Gradient estimation in global optimization algorithms
Abstract— The role of gradient estimation in global optimization is investigated. The concept of a regional gradient is introduced as a tool for analyzing and comparing different...
Megan Hazen, Maya R. Gupta
81
Voted
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
15 years 6 months ago
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
Daniel Lemire, Martin Brooks, Yuhong Yan