602 search results - page 27 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
MP
2006
14 years 9 months ago
2006
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
EUROGP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
143
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Choosing the right representation for a problem is important. In this article we introduce a linear genetic programming approach for motif discovery in protein families, and we al...
MP
2006
14 years 9 months ago
2006
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...