21 search results - page 2 / 5 » Evolving Local Search Heuristics for SAT Using Genetic Progr... |
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
CEC
2011
IEEE
12 years 4 months ago
2011
IEEE
—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...
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
CEC
2010
IEEE
12 years 8 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees....