— In this work, we show that heuristic techniques (particularly Simulated Annealing) can be successfully applied in the search of good non-linear approximations of cryptographic ...
—In a distributed virtual environment interest management schemes attempt to ensure virtual world objects exchange messages only if they are interacting. This provides an opportu...
— Despite having a wide-spread applicability of evolutionary optimization procedures over the past few decades, EA researchers still face criticism about the theoretical optimali...
Kalyanmoy Deb, Rahul Tewari, Mayur Dixit, Joydeep ...
The control of the hand in primate species is characterized by a high dimensionality, due to the large number of joints in the fingers. In this study we present how its manipulatio...
Emmanouil Hourdakis, Michail Maniadakis, Panos E. ...
— Hyper-heuristics or “heuristics that coordinate heuristics” are fastly becoming popular for solving combinatorial optimisation problems. These methods do not search directl...
—The Job-Shop Scheduling Problem (JSSP) is one of the most critical combinatorial optimization problems. The objective of JSSP in this research is to minimize the makespan. In th...
S. M. Kamrul Hasan, Ruhul A. Sarker, David Cornfor...
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Abstract— Multi-parent crossover allows more than two parents participating in crossover. The increase of parents in crossover intensifies exploitation or exploration or both; h...
— Recent large scale experiments have shown that the Normalized Information Distance, an algorithmic information measure, is among the best similarity metrics for melody classi...