Sciweavers

1725 search results - page 157 / 345
» Relaxed genetic programming
Sort
View
CEC
2011
IEEE
13 years 10 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
CEC
2010
IEEE
14 years 11 months ago
Evolving cascades of voting feature detectors for vehicle detection in satellite imagery
We propose an evolutionary method for detection of vehicles in satellite imagery which involves a large number of simple elementary features and multiple detectors trained by genet...
Krzysztof Krawiec, Bartosz Kukawka, Tomasz Macieje...
EMO
2009
Springer
174views Optimization» more  EMO 2009»
15 years 5 months ago
Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we introduce stochastic constraint programming. Stochastic constraint programs contain both decision...
Pascal Van Hentenryck
SIAMJO
2011
14 years 5 months ago
Approximating Semidefinite Packing Programs
In this paper we define semidefinite packing programs and describe an algorithm to approximately solve these problems. Semidefinite packing programs arise in many applications s...
Garud Iyengar, David J. Phillips, Clifford Stein
GECCO
2007
Springer
300views Optimization» more  GECCO 2007»
15 years 4 months ago
A NSGA-II, web-enabled, parallel optimization framework for NLP and MINLP
Engineering design increasingly uses computer simulation models coupled with optimization algorithms to find the best design that meets the customer constraints within a time con...
David J. Powell, Joel K. Hollingsworth