• Publications
  • Influence
Strategies for Searching with Di erent AccessCostsEduardo
Let us consider an ordered set of elements A = fa1 < < ang and a list of positive costs c1; : : : ; cn, where ci is the access cost of the element ai. Any search strategy for the set A can beExpand