It consider the problem of computing efficient strategies for Searching. As a generalization of the classical binary search for ordered array, suppose one wishes to find a specific element in an ordered array by making comparisons, where each comparison indicates the endpoint closer to the desired element. Given the likelihood of each element being the one searched, the objective is to compute ...

In this paper, we propose an algorithm for the positive one-inthree satisfiability problem (Pos1In3Sat). The proposed algorithm decides the existence of a satisfying assignment in all assignments for a given formula by using a 2-dimensional binary search method without constructing all assignments.

Among the models of delayed search discussed in [1], [2], the simplest one can be formulated as the following two–player game. One player, say A, holds a secret number m ∈ M {1, 2, . . . ,M} and another player, say Q, tries to learn the secret number by asking A at time i questions, like “Is m ≥ xi?”, where xi is a number chosen by Q. The rule is that at time i+ d A must answer Q’s question at ...

Despite successful application of constraint programming (CP) to solving many real-life problems there is still an indispensable group or researchers considering (wrongly) CP as a simple evaluation technique only. Even if sophisticated search algorithms play an important role in solving constraint-based models, the real power engine behind CP is called constraint propagation (domain filtering, ...

Constrained multidimensional patterns differ from the well-known frequent patterns from a conceptual and logical points of view because they are provided with a common structure and support various types of constraints. Classical data mining techniques are based on the power set lattice of binary attributes and, even extended, are not suitable when addressing the discovery of constrained multid...

A density functional theory (DFT) -based, combinatorial search for improved oxygen reduction reaction (ORR) catalysts is presented. A descriptor-based approach to estimate the ORR activity of binary surface alloys, wherein alloying occurs only in the surface layer, is described, and rigorous, potential-dependent computational tests of the stability of these alloys in aqueous, acidic environment...

This paper describes and compares techniques for registering an image with respect to a template image when one or both are partially occluded. These techniques can be used to build correlation-based image registration (alignment of similar images) and image search (finding a sub-image within a larger image) algorithms. Binary masks as developed by Stone and Shamoon [18], and extended by Stone ...

There are two types of GAs with difference of their representation of strings. They are the binary coded GA and the order-based GA. We’ve already proposed a new type of binary coded GA, called the forking GA (fGA), as a kind of multi-population GA and showed that the searching power of the fGA is superior to the standard GA. The distinguished feature of the fGA is that each population takes a d...

We present the results of precision timing observations of the binary millisecond pulsar PSR J1640+2224. Combining the pulse arrival time measurements made with the Effelsberg 100-m radio telescope and the Arecibo 305-m radio telescope, we have extended the existing timing model of the pulsar to search for a presence of the effect of a general-relativistic Shapiro delay in the data. At the curr...

Introduced a new binary search tree algorithm, cache-splay, that was the first to achieve the Unified Bound of Iacono since this problem was posed in 2001, and showed that the lower bound framework (see below) applied to a more general model of computation than binary search. Additionally, my thesis summarized my previous work on developing both lower bounds and upper bounds on the cost of sequ...