A Simple Algorithm for Optimal Search Trees with Two-way Comparisons

We present a simple O(n 4 ) -time algorithm for computing optimal search trees with two-way comparisons. The only previous solution to this problem, by Anderson et al., has the same running time but is significantly more complicated and is restricted to the variant where only successful queries are allowed. Our algorithm extends directly to solve the standard full variant of the problem, which also allows unsuccessful queries and for which no polynomial-time algorithm was previously known. The correctness proof of our algorithm relies on a new structural theorem for two-way-comparison search trees.

Physically realizable algorithms for the localization of random pulse-point sources

In this paper, we describe algorithms for the optimal search for pulsed-point sources, and the information on their distribution is limited to single-mode functions with a stepped probability distribution density, which makes it possible to physically implement the algorithms.

Optimal Search and Discovery

This paper studies a search problem in which a consumer is initially aware of only a few products. At every point in time, the consumer then decides between searching among alternatives of which he is already aware and discovering more products. I show that the optimal policy for this search and discovery problem is fully characterized by tractable reservation values. Moreover, I prove that a predetermined index fully specifies the purchase decision of a consumer following the optimal search policy. Finally, a comparison highlights differences to classical random and directed search. This paper was accepted by Dmitri Kuksov, marketing.

Discrete mission planning algorithm for air-sea integrated search model

The selection of optimal search effort for air-sea integrated search has become the most concerned issue for maritime search and rescue (MSAR) departments. Helicopters play an important role in maritime search because of their strong maneuverability and hovering ability. In this work, the requirements of maritime search were analyzed, from which a global optimization model with quantitative constraints for vessels and aircraft was developed by setting the least search time as single-objective optimization problem; then the improved Dinkelbach algorithm was used to solve the continuous programming problem, and the discrete mission planning algorithm was used to improve the calculation accuracy of search time and area. A case study shows that the errors in calculating search time and area decrease from 12–18 min to 36 s and from 76.5 to 0.45 n mile2, respectively. The results obtained from the discrete mission planning algorithm can provide better guidance for MASR departments in selecting optimal search scheme.

Autofocusing Optimal Search Algorithm for a Telescope System

Focus accuracy affects the quality of the astronomical observations. Auto-focusing is necessary for imaging systems designed for astronomical observations. The automatic focus system searches for the best focus position by using a proposed search algorithm. The search algorithm uses the image’s focus levels as its objective function in the search process. This paper aims to study the performance of several search algorithms to select a suitable one. The proper search algorithm will be used to develop an automatic focus system for Kottamia Astronomical Observatory (KAO). The optimal search algorithm is selected by applying several search algorithms into five sequences of star-clusters observations. Then, their performance is evaluated based on two criteria, which are accuracy and number of steps. The experimental results show that the Binary search is the optimal search algorithm.

SMC protein RecN drives translocation and remodelling of RecA filament for homology search

While the molecular repertoire of the homologous recombination pathway is well studied, the search mechanism that enables recombination between distant homologous regions is poorly understood. Here, we follow the dynamics of the recombinase RecA, an essential component of homology search, after induction of a single double-strand break on the Caulobacter chromosome. We find that the RecA-nucleoprotein filament translocates in a directional manner in the cell, undergoing several pole-to-pole traversals, until homology search is complete. Simultaneously, the filament undergoes dynamic remodelling; both translocation and dynamic remodelling are contingent on the action of the SMC protein RecN via its ATPase cycle. We provide a stochastic description of RecN regulated changes in filament length during translocation via modulation of RecA assembly-disassembly. Together, the observed RecN driven RecA dynamics points to a novel optimal search strategy.