455 search results - page 74 / 91 » Adaptive Sampling for Noisy Problems |
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
In recent years there has been a growing interest in studying evolutionary algorithms for dynamic optimization problems due to its importance in real world applications. Several a...
ECCV
2010
Springer
13 years 10 months ago
2010
Springer
Partial differential equations (PDEs) have been successfully applied to many computer vision and image processing problems. However, designing PDEs requires high mathematical skill...
AI
2008
Springer
13 years 7 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
JMLR
2010
13 years 6 months ago
2010
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...