60 search results - page 1 / 12 » On Binary Searching with Nonuniform Costs |
ALGORITHMICA
2000
13 years 4 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
SIAMCOMP
2002
13 years 4 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...
JAIR
2010
13 years 3 months ago
2010
LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must b...
TCS
2008
13 years 4 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
CIAC
2003
Springer
13 years 9 months ago
2003
Springer
