789 search results - page 35 / 158 » Modeling and Analysis of Genetic Algorithm with Tournament S... |
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
108
click to vote
ICTAI
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
We show that linear value-function approximation is equivalent to a form of linear model approximation. We then derive a relationship between the model-approximation error and the...
123
click to vote
ARCS
2012
Springer
13 years 5 months ago
2012
Springer
: This paper presents a novel approach to efficiently perform early system level design space exploration (DSE) of MultiProcessor System-on-Chip (MPSoC) based embedded systems. By...
105
click to vote
KES
1999
Springer
15 years 2 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...