In general, most search engines display a certain number of search results on a search results page at one time, separating the entire search results into multiple search results pages. Therefore, lower ranked results (e.g., 11thranked result) may be displayed on the top area of the next (second) page and might be more likely to be browsed by users, rather than results displayed on the bottom o...

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...

Already in his Lectures on Search Renyi suggested to consider a search problem, where an unknown x ∈ X = {1, 2, . . . , n} is to be found by asking for containment in a minimal number m(n, k) of subsets A1, . . . , Am with the restrictions |Ai| ≤ k < n2 for i = 1, 2, . . . ,m. Katona gave in 1966 the lower bound m(n, k) ≥ log n h( k n) in terms of binary entropy and the upper bound m(n, k) ≤ ⌈

IP address lookup is an important function in a router to settle overall performance of the router. Binary search on range is a useful algorithm based on binary search for IP address lookup. However, this approach requires a lot of memories for adapting binary search to variable-length prefixes. We propose the improved algorithm to reduce memory requirements than binary search on range dramatic...

in this paper, by applying three functional operators the previous results on the(poisson) variance of the external profile in digital search trees will be improved. we study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the poissonized variance, since the probability distribution of...

Cuckoo search (CS) is a novel biologically inspired algorithm and has been widely applied to many fields. Although some binary-coded CS variants are developed to solve 0-1 knapsack problems, the search accuracy and the convergence speed are still needed to further improve. According to the analysis of the shortcomings of the standard CS and the advantage of the global harmony search (GHS), a no...

We revisit the classical algorithms for searching over sorted sets and introduce an algorithm refinement, called adaptive search, that combines the good features of Interpolation search and those of Binary search. W.r.t. Insertion sort, only a constant number of extra comparisons is introduced. Yet, under several relevant input data distributions our algorithm shows average case cost comparable...