1461 search results - page 5 / 293 » The Cost of Cache-Oblivious Searching |
84
Voted
SIAMCOMP
2002
14 years 9 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
102
click to vote
CORR
2008
Springer
14 years 9 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
JAIR
2000
14 years 9 months ago
2000
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
HICSS
2006
IEEE
15 years 3 months ago
2006
IEEE
There are today several methods and standards available for assessment of the level of information security in an enterprise. A problem with these assessment methods is that they ...
62
Voted
AAAI
1997
14 years 10 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...