Sciweavers

1157 search results - page 127 / 232
» Solving iterated functions using genetic programming
Sort
View
SIAMJO
2000
108views more  SIAMJO 2000»
15 years 3 months ago
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
Houyuan Jiang, Daniel Ralph
130
Voted
CEC
2010
IEEE
15 years 4 months ago
Using aesthetic measures to evolve art
In this paper we investigate and compare three aesthetic measures within the context of evolutionary art. We evolve visual art with an unsupervised evolutionary art system using ge...
Eelco den Heijer, A. E. Eiben
CEC
2007
IEEE
15 years 10 months ago
A histogram-matching approach to the evolution of bin-packing strategies
Abstract— We present a novel algorithm for the onedimension offline bin packing problem with discrete item sizes based on the notion of matching the item-size histogram with the...
Riccardo Poli, John Woodward, Edmund K. Burke
TEC
2002
119views more  TEC 2002»
15 years 3 months ago
Graph-based evolutionary design of arithmetic circuits
Abstract--In this paper, we present an efficient graph-based evolutionary optimization technique called evolutionary graph generation (EGG) and the proposed approach is applied to ...
Dingjun Chen, Takafumi Aoki, Naofumi Homma, Toshik...
131
Voted
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
15 years 10 months ago
Towards billion-bit optimization via a parallel estimation of distribution algorithm
This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
Kumara Sastry, David E. Goldberg, Xavier Llor&agra...