Sciweavers

2266 search results - page 190 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 5 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
CEC
2005
IEEE
15 years 7 months ago
A population-based, steady-state procedure for real-parameter optimization
Despite the existence of a number of procedures for real-parameter optimization using evolutionary algorithms, there is still a need of a systematic and unbiased comparison of diļ...
Ankur Sinha, Santosh Tiwari, Kalyanmoy Deb
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 5 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
GECCO
2009
Springer
135views Optimization» more  GECCO 2009»
15 years 8 months ago
Steady-state ALPS for real-valued problems
The objectives of this paper are to describe a steady-state version of the Age-Layered Population Structure (ALPS) Evolutionary Algorithm (EA) and to compare it against other GAs ...
Gregory S. Hornby
GECCO
2007
Springer
161views Optimization» more  GECCO 2007»
15 years 8 months ago
Alternative techniques to solve hard multi-objective optimization problems
In this paper, we propose the combination of different optimization techniques in order to solve ā€œhardā€ two- and threeobjective optimization problems at a relatively low comp...
Ricardo Landa Becerra, Carlos A. Coello Coello, Al...