Sciweavers

2152 search results - page 413 / 431
» Backward-chaining evolutionary algorithms
Sort
View
94
Voted
GECCO
2009
Springer
145views Optimization» more  GECCO 2009»
15 years 2 months ago
Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences
Optimizing the hypervolume indicator within evolutionary multiobjective optimizers has become popular in the last years. Recently, the indicator has been generalized to the weight...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
EH
1999
IEEE
351views Hardware» more  EH 1999»
15 years 1 months ago
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...
Marek A. Perkowski, Alan Mishchenko, Anatoli N. Ch...
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
15 years 1 months ago
Smart crossover operator with multiple parents for a Pittsburgh learning classifier system
This paper proposes a new smart crossover operator for a Pittsburgh Learning Classifier System. This operator, unlike other recent LCS approaches of smart recombination, does not ...
Jaume Bacardit, Natalio Krasnogor
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 1 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
COLT
2008
Springer
14 years 11 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim