In this paper we prove global convergence for asynchronous parallel pattern search. In standard pattern search, decisions regarding the update of the iterate and the step-length control parameter are synchronized implicitly across all search directions. We lose this feature in asynchronous parallel pattern search since the search along each direction proceeds semiautonomously. By bounding the v...

Web search is a key technology of the Web, since it is the primary way to access content on the Web. Current standard Web search is essentially based on a combination of textual keyword search with an importance ranking of the documents depending on the link structure of the Web. For this reason, it has many limitations, and there are a plethora of research activities towards more intelligent f...

Searching for objects with unknown locations based on random walks can be optimized when the walkers obey Lévy distributions with a critical exponent. We consider the problem of optimizing statistical searches when a priori information, such as location densities, are known. We consider both spatially dependent exponents and biased search directions. For spatially localized target distributions...

A fast block motion estimation algorithm is proposed using modified diamond search patterns. This algorithm utilises the directions and magnitudes of motion vectors between interblocks and uses a smaller number of seach points than conventional diamond search patterns. Simulation results show that the proposed method significantly improves computational speed over other fast motion estimation a...

We consider a direct search approach for solving nonsmooth minimization problems where the objective function is locally Lipschitz continuous and piecewise continuously differentiable on a finite family of polyhedra. A generating set search method is proposed, which is named structured because the structure of the set of nondifferentiability near the current iterate is exploited to define the s...

This paper presents several modifications to the basic rapidly-exploring random tree (RRT) search algorithm. The fundamental idea is to utilize a heuristic quality function to guide the search. Results from a relevant simulation experiment illustrate the benefit and drawbacks of the developed algorithms. The paper concludes with several promising directions for future research.

The HiRes collaboration has searched for intermediate-scale anisotropy of ultrahigh energy cosmic rays in two ways: first a search for variation with declination of the flux of cosmic rays, and second in their arrival directions. The data of the HiRes-II detector was used in the search.

A significant body of recent literature has explored various research directions in hyperheuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend our previous work to construct a unified graph based hyper-heuristic (GHH) framework, under which a number of local search based algorithms as the high level heuristics are studied to search upon sequences of low ...

Simplified Dolphin Echolocation (SDE) optimization is an improved version of the Dolphin Echolocation optimization. The dolphin echolocation (DE) is a recently proposed metaheuristic algorithm, which was imitated dolphin’s hunting process. The global or near global optimum solution modeled as dolphin’s bait, dolphins send sound in different directions to discover the best bait among their searc...