Cuckoo Search is gaining a lot of attention as a new soft computing technique inspired by nature,in this research the application of Cuckoo Search for solving the problem of estimating the parameters of a nonlinear model is investigated from both aspects of efficiency and robustness. Using a case study of estimation of parameters of a nonlinear model for the cutting tool temperature in an indus...

The results of a search for cool subdwarfs are presented. Kinematic (U, V, and W) and stellar parameters (Teff , log g, [Fe/H], and ξt) are derived for 134 candidate subdwarfs based on high resolution spectra. The observed stars span 4200K < Teff < 6400K and −2.70 < [Fe/H] < 0.25 including only 8 giants (log g < 4.0). Of the sample, 100 stars have MgH bands present in their spectra. The targets...

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

The performance of several network protocols can be significantly enhanced by tuning their parameters. The optimization of network protocol parameters can be modeled as a “black-box” optimization problem with unknown, multi-modal and noisy objective functions. In this paper, a recursive random search algorithm is proposed to address this type of optimization problems. The new algorithm takes ad...

Many artificial intelligence techniques rely on heuristic search through large spaces. Because the computational effort required to search through these spaces reduces the applicability of the techniques, a number of parallel and distributed approaches to search have been introduced to improve the performance of certain aspects of the search process. However, theoretical and experimental result...

The performance of several network protocols can be significantly enhanced by tuning their parameters. The optimization of network protocol parameters can be modeled as a “black-box” optimization problem with unknown, multi-modal and noisy objective functions. In this paper, a recursive random search algorithm is proposed to address this type of optimization problems. The new algorithm takes ad...

The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is assumed to have complete knowledge of the graph and of the searchers’ moves, but is restricted to move only along paths whose vertices are not guarded by searchers. The search number of the graph is the least number of s...

The accuracy of search guidance is reflected in the probability of fixating distractors within a search display as a function of their similarity to the target (e.g., Stroud et al. , JEP: HPP, 2012). Strong search guidance produces high fixation rates to distractors that match the target on a given dimension (e.g., color), and low fixation rates to distractors that do not match the target. When...

The optimization of network protocol parameters based on network simulation can be considered a “black-box” optimization problem with unknown, multi-modal and noisy objective functions. In this paper, an adaptive random search algorithm is proposed to perform efficient and robust optimization for the concerned problems. Specifically, the algorithm is designed for use by the on-line simulation s...

The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering (e1; : : : ; er) in such a way that for every i = 1; : : : ; r 1, there are at most k vertices incident to edges that belong both to fe1; : : : ; eig and to fei+1; : : : ; erg. In this paper, we give a set of 57 graphs and prove that it is the set of the minimal for...