SIGECOM
2002
ACM
13 years 4 months ago
2002
ACM
SIGECOM
2002
ACM
13 years 4 months ago
2002
ACM
SIGECOM
2002
ACM
13 years 4 months ago
2002
ACM
SIGECOM
2002
ACM
13 years 4 months ago
2002
ACM
EC
1998
13 years 4 months ago
1998
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
EC
1998
13 years 4 months ago
1998
Parsimony pressure, the explicit penalization of larger programs, has been increasingly used as a means of controlling code growth in genetic programming. However, in many cases p...
EC
1998
13 years 4 months ago
1998
EC
1998
13 years 4 months ago
1998
In this paper we first review the main results obtained in the theory of schemata in Genetic Programming (GP) emphasising their strengths and weaknesses. Then we propose a new, s...
EC
1998
13 years 4 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
EC
1998
13 years 4 months ago
1998
This paper analyzes different representations for permutation flowshop problems. This is done using forma analysis to assess the quality of these representations with respect to m...