Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
Abstract. This paper proposes a novel algorithm for complete exact patternmatching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficie...
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...