217 search results - page 6 / 44 » On the Fine Structure of Large Search Spaces |
ICDE
2000
IEEE
14 years 8 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
KI
2001
Springer
13 years 12 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
PAMI
2007
13 years 7 months ago
2007
—We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. M...
ICST
2009
IEEE
14 years 2 months ago
2009
IEEE
Constraint solving lies at the heart of several specification-based approaches to automated testing. Korat is a previously developed algorithm for solving constraints in Java pro...
AAAI
1996
13 years 8 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...