1717 search results - page 44 / 344 » On the analysis of the (1 1) memetic algorithm |
76
Voted
CHES
2007
Springer
15 years 6 months ago
2007
Springer
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...
83
Voted
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
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...
93
Voted
PPSN
2000
Springer
15 years 4 months ago
2000
Springer
This work introduces a general mathematical framework for non-stationary fitness functions which enables the exact definition of certain problem properties. The properties' in...
113
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
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 ...
87
Voted
BMCBI
2006
15 years 20 days ago
2006
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...