Sciweavers

6095 search results - page 282 / 1219
» Learning in Local Search
Sort
View
LPNMR
2004
Springer
15 years 12 months ago
Answer Set Programming with Clause Learning
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
Jeffrey Ward, John S. Schlipf
CVPR
2009
IEEE
1289views Computer Vision» more  CVPR 2009»
17 years 1 months ago
Bundling Features for Large Scale Partial-Duplicate Web Image Search
In state-of-the-art image retrieval systems, an image is represented by a bag of visual words obtained by quantizing high-dimensional local image descriptors, and scalable schem...
Zhong Wu (Tsinghua University), Qifa Ke (Microsoft...
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
16 years 6 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal

Book
392views
17 years 4 months ago
Reinforcement Learning: An Introduction
"Reinforcement learning is learning what to do how to map situations to actions so as to maximize a numerical reward signal. The learner is not told which actions to take, as ...
Richard S. Sutton, Andrew G. Barto
150
Voted
EWCBR
2004
Springer
16 years 8 hour ago
Exploiting Background Knowledge when Learning Similarity Measures
The definition of similarity measures—one core component of every CBR application—leads to a serious knowledge acquisition problem if domain and application specific requirem...
Thomas Gabel, Armin Stahl