135 search results - page 13 / 27 » Real-Coded Genetic Algorithm for Solving Generalized Polynom... |
ESOP
1999
Springer
14 years 27 days ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
MFCS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
GECCO
2006
Springer
14 years 8 days ago
2006
Springer
This poster paper investigates the potential of single and multiobjective genetic operators with an object-oriented conceptual design space. Using cohesion as an objective fitness...
GECCO
2009
Springer
14 years 3 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...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....