44 search results - page 7 / 9 » On Solving Boolean Optimization with Satisfiability-Based Al... |
160
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
168
click to vote
CEC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Despite their success as optimization methods, evolutionary algorithms face many difficulties to design artifacts with complex structures. According to paleontologists, living...
117
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
144
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
135
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...