Constraint satisfaction problems (CSPs) naturally occur in a number of important industrial applications such as planning and scheduling defeating many algorithmic search methods. GENET and it extended model, EGENET, are probabilistic neural networks which had some remarkable success in solving some hard instances of CSPs such as a set of hard graph coloring problems. Both GENET or EGENET does ...

This paper addresses the problem of noisy Generalized Binary Search (GBS). GBS is a well-known greedy algorithm for determining a binary-valued hypothesis through a sequence of strategically selected queries. At each step, a query is selected that most evenly splits the hypotheses under consideration into two disjoint subsets, a natural generalization of the idea underlying classic binary searc...

This paper proposes a modification to the traditional binary search algorithm in which it checks the presence of the input element with the middle element of the given set of elements at each iteration. Modified binary search algorithm optimizes the worst case of the binary search algorithm by comparing the input element with the first & last element of the data set along with the middle elemen...

We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any “well-behaved” bound on the running time of the given BSTs, for any online access sequence. (A BST has a well-behaved bound with f(n) overhead if it spends at most O(f(n)) time per access and its b...

In a mobile computing environment that supports mobile agents, a client can send an agent to visit a sequence of servers in the network. Tracking the' location of agents becomes a critical problem in managing a mobile agent servic~ network. In our previous papers, we had developed a few strategies to search an agent in a sequential search liSt The Extended Binary Search algorithm recursively pr...

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 o...

We study the number of records in a random binary search tree on n randomly labelled vertices. Equivalently the number of random cuttings required to eliminate a random binary search tree can be studied. After normalization the distribution is shown to be asymptotically 1-stable.

Abstract: In recent decades, high profits of extended warranty have caused that third-party firms consider it as a lucrative after-sales service. However, customers division in terms of risk aversion and effect of offering extended warranty on manufacturers’ basic warranty should be investigated through adjusting such services. Since risk-averse customers welcome extended warranty, while the cu...

A non-binary Constraint Satisfaction Problem (CSP) can be solved directly using extended versions of binary techniques. Alternatively, the non-binary problem can be translated into an equivalent binary one. In this case, it is generally accepted that the translated problem can be solved by applying well-established techniques for binary CSPs. In this paper we evaluate the applicability of the l...

Research explored possible benefits of parallel programming for the binary search, specifically relating to how divisions of threads in a binary search affected efficiency of the algorithm. A unique search, named Congruent Binary Search (CBS), was written with the goal of avoiding the pitfalls of the standard parallel binary search. It was hypothesized the CBS would run in , where N is number o...