Sciweavers

1356 search results - page 127 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
EUROGP
2004
Springer
129views Optimization» more  EUROGP 2004»
14 years 2 months ago
Evolution and Acquisition of Modules in Cartesian Genetic Programming
The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of...
James Alfred Walker, Julian Francis Miller
PSD
2004
Springer
132views Database» more  PSD 2004»
14 years 2 months ago
Computational Experiments with Minimum-Distance Controlled Perturbation Methods
Minimum-distance controlled perturbation is a recent family of methods for the protection of statistical tabular data. These methods are both efficient and versatile, since can dea...
Jordi Castro
CSCLP
2003
Springer
14 years 2 months ago
Clustering for Disconnected Solution Sets of Numerical CSPs
This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interv...
Xuan-Ha Vu, Djamila Sam-Haroud, Boi Faltings
GECCO
2009
Springer
113views Optimization» more  GECCO 2009»
14 years 1 months ago
Variable size population for dynamic optimization with genetic programming
A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. pro...
Leonardo Vanneschi, Giuseppe Cuccu
ICLP
1998
Springer
14 years 1 months ago
A Choice-Point Library for Backtrack Programming
Implementing a compiler for a language with nondeterministic features is known to be a difficult task. This paper presents two new functions setChoicePoint and fail that extend th...
Pierre-Etienne Moreau