Sciweavers

602 search results - page 5 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
AE
1995
Springer
14 years 1 months ago
Mixed IFS: Resolution of the Inverse Problem Using Genetic Programming
Guillaume Cretin, Evelyne Lutton, Jacques Lé...
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
14 years 2 months ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
CP
2009
Springer
14 years 10 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
ESA
2009
Springer
112views Algorithms» more  ESA 2009»
14 years 4 months ago
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
Johan M. M. van Rooij, Hans L. Bodlaender, Peter R...
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
A new crossover technique for Cartesian genetic programming
Genetic Programming was first introduced by Koza using tree representation together with a crossover technique in which random sub-branches of the parents' trees are swapped ...
Janet Clegg, James Alfred Walker, Julian Francis M...