Sciweavers

5624 search results - page 630 / 1125
» On Conditional Covering Problem
Sort
View
AAAI
2010
15 years 8 months ago
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
Miquel Ramírez, Hector Geffner
NIPS
2007
15 years 8 months ago
Transfer Learning using Kolmogorov Complexity: Basic Theory and Empirical Evaluations
In transfer learning we aim to solve new problems using fewer examples using information gained from solving related problems. Transfer learning has been successful in practice, a...
M. M. Mahmud, Sylvian R. Ray
ACSW
2004
15 years 8 months ago
Applying Online Gradient Descent Search to Genetic Programming for Object Recognition
This paper describes an approach to the use of gradient descent search in genetic programming (GP) for object classification problems. In this approach, pixel statistics are used ...
William D. Smart, Mengjie Zhang
IJCAI
2001
15 years 7 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
NIPS
2003
15 years 7 months ago
Factorization with Uncertainty and Missing Data: Exploiting Temporal Coherence
The problem of “Structure From Motion” is a central problem in vision: given the 2D locations of certain points we wish to recover the camera motion and the 3D coordinates of ...
Amit Gruber, Yair Weiss