107 search results - page 2 / 22 » Finding Compact BDDs Using Genetic Programming |
GECCO
2008
Springer
13 years 6 months ago
2008
Springer
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
COCOA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
GPEM
2006
13 years 5 months ago
2006
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software ree...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...