16091 search results - page 369 / 3219 » Solving |
170
click to vote
NIPS
2007
15 years 8 months ago
2007
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...
191
click to vote
AAAI
2006
15 years 8 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
177
click to vote
AIPS
2006
15 years 8 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
141
click to vote
AIPS
2006
15 years 8 months ago
2006
Policy Reuse is a method to improve reinforcement learning with the ability to solve multiple tasks by building upon past problem solving experience, as accumulated in a Policy Li...
184
click to vote
AIPS
2006
15 years 8 months ago
2006
Mixed-Initiative approaches to Planning and Scheduling are being applied in different real world domains. While several recent successful examples of such tools encourage a wider ...