3415 search results - page 567 / 683 » Lower Bounds for Kernelizations |
104
click to vote
AIPS
2006
15 years 5 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...
139
click to vote
DAGSTUHL
2004
15 years 5 months ago
2004
A large part of safety-critical embedded systems has to satisfy hard real-time constraints. These need sound methods and tools to derive reliable run-time guarantees. The guarante...
159
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
Abstract. Similarity search in large multimedia databases requires efficient query processing based on suitable similarity models. Similarity models consist of a feature extraction...
117
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
160
click to vote
FLAIRS
2006
15 years 5 months ago
2006
In real-life decision analysis, the probabilities and values of consequences are in general vague and imprecise. One way to model imprecise probabilities is to represent a probabi...