Sciweavers

995 search results - page 46 / 199
» Learning Useful Horn Approximations
Sort
View
ICFP
2007
ACM
14 years 9 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
SMA
2005
ACM
239views Solid Modeling» more  SMA 2005»
14 years 3 months ago
Bender: a virtual ribbon for deforming 3D shapes in biomedical and styling applications
In contrast to machined mechanical parts, the 3D shapes encountered in biomedical or styling applications contain many tubular parts, protrusions, engravings, embossings, folds, a...
Ignacio Llamas, Alexander Powell, Jarek Rossignac,...
JAIR
2010
131views more  JAIR 2010»
13 years 8 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
WSC
2004
13 years 11 months ago
Function-Approximation-Based Importance Sampling for Pricing American Options
Monte Carlo simulation techniques that use function approximations have been successfully applied to approximately price multi-dimensional American options. However, for many pric...
Nomesh Bolia, Sandeep Juneja, Paul Glasserman
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 4 months ago
Pathologies of temporal difference methods in approximate dynamic programming
Approximate policy iteration methods based on temporal differences are popular in practice, and have been tested extensively, dating to the early nineties, but the associated conve...
Dimitri P. Bertsekas