This paper addresses the search problem for lost floating targets on sea surface. Given the expected search region, we analyze spiral search patterns for finding the target. Specifically, we consider two search patterns: outward spiral and inward spiral. The outward spiral pattern is a greedy strategy which initializes from the mean of the search region and expands outwards to cover the entire ...

An improved algorithm for fast motion estimation based on the block matching algorithm (BMA) is presented for use in a blockbased video coding system. To achieve enhanced motion estimation performance, we propose an adaptive search pattern length for each iteration for the current macro block (MB). In addition, search points that must be checked are determined by means of directional informatio...

This paper presents and analysis the common existing sequential pattern mining algorithms. It presents a classifying study of sequential pattern-mining algorithms into five extensive classes. First, on the basis of Apriori-based algorithm, second on Breadth First Search-based strategy, third on Depth First Search strategy, fourth on sequential closed-pattern algorithm and five on the basis of i...

A new technique presents to improve the performance of dynamic voltage restorer (DVR) for voltage sag mitigation. This control scheme is based on cuckoo search algorithm with tree fuzzy rule based classifier (CSA-TFRC). CSA is used for optimizing the output of TFRC so the classification output of the network is enhanced. While, the combination of cuckoo search algorithm, fuzzy and decision tree...

University of Connecticut 1.1 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-1 1.2 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-1 1.3 Algorithms for Planted Motif Search . . . . . . . . . . . . . . . 1-2 A Probabilistic Analysis • The WINNOWER and SP-STAR Algorithms • Pattern Br...

This paper introduces the optimization algorithm to improve search rate in urban path routing problems using viral infection and local search in urban environment. This algorithm operates based on two different approaches including wavelet transform and genetic algorithm. The variables proposed by driver such as degree of difficulty and difficulty traffic are of the essence in this technique. W...

Given finite sets P and T of points in the Euclidean space R, the point pattern matching problem studied in this paper is to find all translations f ∈ R such that P + f ⊆ T . A fast search algorithm with some variants is presented for point patterns P that have regular grid–like geometric shape. The algorithm is analogous to the Knuth–Morris–Pratt algorithm of string matching. The time requirem...

EEcient discovery of conserved patterns using a pattern graph. Abstract We have earlier reported an algorithm JCH95] for discovering patterns conserved in sets of related protein sequences. The algorithm was implemented in a program called Pratt. It uses a depth rst search of the pattern space, together with a data structure making it possible to nd all segments matching a pattern very quickly ...

Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...