When an optimization problem is encoded using genetic algorithms, one must address issues of population size, crossover and mutation operators and probabilities, stopping criteria...
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
—Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an associati...
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Positioning multiple sensors for acquisition of a a given environment is one of the fundamental research areas in various fields, such as military scouting, computer vision and ro...