791 search results - page 75 / 159 » Nonstationary Function Optimization using the Structured Gen... |
145
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
137
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: In this paper, it is proposed an optimization approach for producing reduced alphabets for peptide classification, using a Genetic Algorithm. The classification task i...
154
click to vote
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
170
click to vote
ALIFE
2005
15 years 4 months ago
2005
We present a new definition of the concept of representation for cognitive science that is based on a study of the origin of structures that are used to store memory in evolving sy...
181
click to vote
PPOPP
2011
ACM
14 years 7 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...