GECCO
2004
Springer
14 years 4 months ago
2004
Springer
A critical success factor in Insurance business is its ability to use information sources and contained knowledge in the most effective way. Its profitability is obtained through t...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
As the Flexible Job Shop Scheduling Problem (or FJSP) is strongly NP-hard, using an evolutionary approach to find near-optimal solutions requires effective chromosome representatio...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Extending the notion of inheritable genotype in genetic programming (GP) from the common model of DNA into chromatin (DNA and histones), we propose an approach of embedding in GP a...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Inspired by the efficient method of locomotion of the rattlesnake Crotalus cerastes, the objective of this work is automatic design through genetic programming, of the fastest poss...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
In this work, we investigate the ability of a Chunking GA (ChGA) to reduce the size of variable length chromosomes and control bloat. The ChGA consists of a standard genetic algori...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
In financial engineering the problem of portfolio selection has drawn much attention in the last decades. But still unsolved problems remain, while on the one hand the type of mod...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In recent years several strategies for inferring gene regulatory networks from observed time series data of gene expression have been suggested based on Evolutionary Algo...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...