444 search results - page 43 / 89 » Solving Mastermind Using Genetic Algorithms |
ERCIMDL
2000
Springer
14 years 8 days ago
2000
Springer
Segmentation of a colour image composed of different kinds of texture regions can be a hard problem, namely to compute for an exact texture fields and a decision of the optimum num...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
GECCO
2009
Springer
14 years 3 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...
AISB
1997
Springer
14 years 25 days ago
1997
Springer
A technique for the credible modelling of economic agents with bounded rationality based on the evolutionary techniques is described. The genetic programming paradigm is most suite...
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....