139 search results - page 2 / 28 » Deriving evaluation metrics for applicability of genetic alg... |
GECCO
2007
Springer
13 years 11 months ago
2007
Springer
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
ICDAR
2003
IEEE
13 years 10 months ago
2003
IEEE
Classifying an unknown input is a fundamental problem in pattern recognition. A common method is to define a distance metric between patterns and find the most similar pattern i...
PDPTA
2000
13 years 6 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
GECCO
2005
Springer
13 years 10 months ago
2005
Springer
Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a maj...