Sciweavers

206 search results - page 7 / 42
» Learning Heuristic Functions from Relaxed Plans
Sort
View
CGI
2001
IEEE
15 years 1 months ago
Paint By Relaxation
We use relaxation to produce painted imagery from images and video. An energy function is first specified; we then search for a painting with minimal energy. The appeal of this st...
Aaron Hertzmann
AIPS
2006
14 years 11 months ago
Lessons Learned in Applying Domain-Independent Planning to High-Speed Manufacturing
Much has been made of the need for academic planning research to orient towards real-world applications. In this paper, we relate our experience in adapting domain-independent pla...
Minh Binh Do, Wheeler Ruml
ADCM
2006
74views more  ADCM 2006»
14 years 9 months ago
Linearly constrained reconstruction of functions by kernels with applications to machine learning
This paper investigates the approximation of multivariate functions from data via linear combinations of translates of a positive definite kernel from a reproducing kernel Hilbert...
Robert Schaback, J. Werner
KER
2007
90views more  KER 2007»
14 years 9 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
INFORMS
2010
125views more  INFORMS 2010»
14 years 8 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...