Sciweavers

116 search results - page 3 / 24
» Improving convergence of the stochastic decomposition algori...
Sort
View
ICRA
2009
IEEE
196views Robotics» more  ICRA 2009»
13 years 6 months ago
CHOMP: Gradient optimization techniques for efficient motion planning
Abstract-- Existing high-dimensional motion planning algorithms are simultaneously overpowered and underpowered. In domains sparsely populated by obstacles, the heuristics used by ...
Nathan D. Ratliff, Matt Zucker, J. Andrew Bagnell,...
VMV
2000
146views Visualization» more  VMV 2000»
13 years 10 months ago
Efficient Importance Sampling Techniques for the Photon Map
In global illumination computations the photon map is a powerful tool for approximating the irradiance, which is stored independent from scene geometry. By presenting a new algori...
Alexander Keller, Ingo Wald
CCE
2006
13 years 8 months ago
An efficient algorithm for large scale stochastic nonlinear programming problems
The class of stochastic nonlinear programming (SNLP) problems is important in optimization due to the presence of nonlinearity and uncertainty in many applications, including thos...
Y. Shastri, Urmila M. Diwekar
CSC
2006
13 years 10 months ago
Developing Efficient Option Pricing Algorithms by Combinatorial Techniques
How to price options efficiently and accurately is an important research problem. Options can be priced by the lattice model. Although the pricing results converge to the theoreti...
Tian-Shyr Dai, Yuh-Dauh Lyuu, Li-min Liu
JMLR
2010
165views more  JMLR 2010»
13 years 3 months ago
Learning with Blocks: Composite Likelihood and Contrastive Divergence
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
Arthur Asuncion, Qiang Liu, Alexander T. Ihler, Pa...