Sciweavers

1259 search results - page 32 / 252
» In search of the memoryless property
Sort
View
FSTTCS
1991
Springer
13 years 11 months ago
Randomizing Reductions of Search Problems
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
Andreas Blass, Yuri Gurevich
DEXA
2008
Springer
155views Database» more  DEXA 2008»
13 years 9 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc
AAAI
1997
13 years 9 months ago
Evidence for Invariants in Local Search
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
David A. McAllester, Bart Selman, Henry A. Kautz
WWW
2007
ACM
14 years 8 months ago
Web projections: learning from contextual subgraphs of the web
Graphical relationships among web pages have been leveraged as sources of information in methods for ranking search results. To date, specific graphical properties have been used ...
Jure Leskovec, Susan T. Dumais, Eric Horvitz
CP
2009
Springer
14 years 8 months ago
An Interpolation Method for CLP Traversal
We consider the problem of exploring the search tree of a CLP goal in pursuit of a target property. Essential to such a process is a method of tabling to prevent duplicate explorat...
Joxan Jaffar, Andrew E. Santosa, Razvan Voicu