Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
Chaotic image encryption design using Tompkins-Paige algorithm.
Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.
Computing communities in large networks using random walks.
Convergence behavior of the (1 +, λ) evolution strategy on the ridge functions.
The convergence behavior of (1 +, λ)-ES is investigated at parabolic ridge, sharp ridge, and at the general case of the ridge functions. The progress rate, the distance to the ridge axis, the success rate, and the success probability are used in the analysis. The strong dependency of the (1 + λ)-ES to the initial conditions is shown using parabolic ridge test function when low distances to the ridge axis are chosen as the start value. The progress rate curve and the success probability curve of...