Sciweavers

UAI
2003
14 years 28 days ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
14 years 5 months ago
Transfer of Learning for Complex Task Domains: a Demonstration using Multiple Robots
— This paper demonstrates a learning mechanism for complex tasks. Such tasks may be inherently expensive to learn in terms of training time and/or cost of obtaining each training...
Sameer Singh, Julie A. Adams