Contrarily to Kerckhoffs’ principle, many applications of today’s cryptography still adopt the security by obscurity paradigm. Furthermore, in order to rely on its proven or e...
Evolutionary algorithms applied to dynamic optimization problems has become a promising research area. So far, all papers in the area have assumed that the environment changes only...
This work introduces a general mathematical framework for non-stationary fitness functions which enables the exact definition of certain problem properties. The properties' in...
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...