1725 search results - page 38 / 345 » Relaxed genetic programming |
MP
2006
13 years 10 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...
GECCO
2009
Springer
14 years 4 months ago
2009
Springer
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
In recent years the computing power of graphics cards has increased significantly. Indeed, the growth in the computing power of these graphics cards is now several orders of magn...
HIS
2007
13 years 11 months ago
2007
Genetic programming is known to provide good solutions for many problems like the evolution of network protocols and distributed algorithms. In such cases it is most likely a hard...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
A developmental model of neural network is presented and evaluated in the game of Checkers. The network is developed using cartesian genetic programs (CGP) as genotypes. Two agent...