The nearest neighbour (NN) and k-nearest neighbour (kNN) classi cation rules have been widely used in pattern recognition due to its simplicity and good behaviour. Exhaustive nearest neighbour search can become unpractical when facing large training sets, high dimensional data or expensive similarity measures. In the last years a lot of NN search algorithms have been developed to overcome those...

Multi-path transmission is an efficient way to balance the power consumption from a source to a destination. The previous works have studied rate–power allocation to prolong the network lifetime of multiple paths. As at least one relay node is required to participate into cooperative transmission, its assignment will greatly impact the power consumption of cooperative communication. Thus, this ...

This paper presents a new power system planning strategy which combines firefly algorithm (FFA) with pattern search algorithm (PS). The purpose is minimizing total fuel cost, total power loss and reducing total voltage deviation, with the objective of enhancing the loading margin stability and consequently the power system security. A new interactive and simple mechanism, inspired in brainstorm...

Abstract: A previous analysis of second-order behavior of pattern search algorithms for unconstrained and linearly constrained minimization is extended to the more general class of mesh adaptive direct search (MADS) algorithms for general constrained optimization. Because of the ability of MADS to generate an asymptotically dense set of search directions, we are able to establish reasonable con...

This paper presents a convergence theory for evolutionary pattern search algorithms (EP-SAs). EPSAs are self-adapting evolutionary algorithms that modify the step size of the mutation operator in response to the success of previous optimization steps. Previously, we have proven a stationary point convergence theory for EPSAs for which the step size is not allowed to increase. The present analys...

Many suboptimal motion vector search algorithms have been proposed because the full search algorithm, which is an optimal method, requires huge computational cost. Most of these algorithms find motion vectors simply from the center of the search window. In this paper, we propose an efficient motion vector search algorithm which, in order to predict the initial search point, exploits the global ...

although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. but, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. this paper considers the problem of scheduling no-idle hybrid flow shops. a mixed integer linear programming model is first developed to mathematically form...

this paper presents a clear monograph on the optimization of thermal instability resistance of the fg (functionally graded) flat structures. for this aim, two fg flat structures, namely an fg beam and an fg circular plate, are considered. these structures are assumed to obey the first-order shear deformation theory, three-parameters power-law distribution of the constituents, and clamped bounda...