224 search results - page 1 / 45 » Some theoretical results about the computation time of evolu... |
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
This paper focuses on the computation time of evolutionary algorithms. First, some exact expressions of the mean first hitting times of general evolutionary algorithms in finite...
EOR
2007
13 years 4 months ago
2007
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
AAAI
2006
13 years 6 months ago
2006
The expected first hitting time is an important issue in theoretical analyses of evolutionary algorithms since it implies the average computational time complexity. In this paper,...
GECCO
2007
Springer
13 years 10 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
PPSN
2004
Springer
13 years 10 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...