4229 search results - page 291 / 846 » On the Optimality of Spiral Search |
128
click to vote
ICDCS
1999
IEEE
15 years 6 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
115
click to vote
SIGIR
2010
ACM
15 years 5 months ago
2010
ACM
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
132
click to vote
CG
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
127
click to vote
CPAIOR
2008
Springer
15 years 3 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
116
click to vote
ICGA
1997
15 years 3 months ago
1997
Molecular docking software makes computational predictions of the interaction of molecules. This can be useful, for example, in evaluating the binding of candidate drug molecules ...