Searching for data is one of the fundamental fields of computing. Often, the difference between a fast and slow one is the use of good algorithm for the data set. The efficiency of searching techniques used in a task will determine how fast such task can be completed. In this work, the efficiency of linear and binary searching techniques in terms of running time, memory usage and the numbers of...

When searching for hosts on a plant, female parasitoids use strategies to maximize efficiency. Searching strategies include the expressed behaviors, the time budget associated with each behavior, the time allocated to the different plant parts and the exploration sequence of plant parts. Searching efficiency refers to the time taken to find the first egg, the number of eggs found per foraging t...

functional response, as describing the rates of predation in different prey density, and determining the predator efficiency, is important in the regulation of prey populations. the functional response of male and female adult of lady beetle, hippodamia variegata, was studied at different densities of green peach aphid under laboratory conditions on canola brassica napus l. (cv. rgs003). nymphs...

Autonomous intelligent robotic systems that can survive in dynamic changing environments have yet to be realized. The robot must process incoming information, make decisions, and learn from previous actions concurrently and in real time. Reliance on one all-encompassing system with one overburdened processor, no matter how fast, makes this goal unreachable. One of the primary reasons the goal i...

Similarity searching finds application in a wide variety of domains including multilingual databases, computational biology, pattern recognition and text retrieval. Similarity is measured in terms of a distance function (edit distance) in general metric spaces, which is expensive to compute. Indexing techniques can be used reduce the number of distance computations. We present an analysis of va...

Searching and Browsing on E-commerce Sites: Frequency, Efficiency and Rationale

Efficiently storing and searching collections of similar strings, such as large populations of genomes or long change histories of documents from Wikis, is a timely and challenging problem. Several recent proposals could drastically reduce space requirements by exploiting the similarity between strings in so-called referencebased compression. However, these indexes are usually not searchable an...