Meta-heuristic algorithms have been effectively employed to tackle a wide range of optimisation issues, including structural engineering challenges. The the shape and size large-scale truss structures is difficult due nonlinear interplay between cross-sectional nodal coordinate pressures structures. Recently, it was demonstrated that newly proposed Marine Predator Algorithm (MPA) performs very ...

Résumé en anglais Hill-climbing constitutes one of the simplest way to produce approximate solutions of a combinatorial optimization problem, and is a central component of most advanced metaheuristics. This paper focuses on evaluating climbing techniques in a context where deteriorating moves are not allowed, in order to isolate the intensification aspect of metaheuristics. We aim at providing ...

--This paper presents the genetic algorithm approach to adaptive optimal economic dispatch of Electrical Power Systems. Artificial Immune System Algorithms, also termed as the machine learning approach to Artificial Intelligence, are powerful stochastic optimization techniques with potential features of random search, hill climbing, statistical sampling and competition. Artificial immune system...

S-boxes play an important role in ensuring the resistance of block ciphers against cryptanalysis as often they are their only nonlinear components. The cryptographic properties of S-boxes and a variety of constructions have been studied extensively over the past years. Techniques for S-box generation include algebraic constructions, pseudo-random generation and heuristic approaches. The family ...

One of the basic problems of user on manual wheelchair is overcoming architectural barriers (kerbs, stairs etc.) on its way. Even though many research studies have been reported in different fields to increase the independence of wheelchair users, the question of overcoming obstacles by a wheelchair always remains as topic of discussion for many researchers. In this paper, the author has propos...

We use directed search techniques in the space of computer programs to learn recursive sequences of positive integers. Specifically, the integer sequences of squares, x; cubes, x; factorial, x!; and Fibonacci numbers are studied. Given a small nite pre x of a sequence, we show that three directed searches|machine-language genetic programming with crossover, exhaustive iterative hill climbing, a...