602 search results - page 66 / 121 » Unsupervised Problem Decomposition Using Genetic Programming |
SIGADA
2004
Springer
15 years 3 months ago
2004
Springer
Genetic Algorithms provide computational procedures that are modeled on natural genetic system mechanics, whereby a coded solution is “evolved” from a set of potential solutio...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
We solve the Flexible Job-Shop Problem (FJSP) by using dispatching rules discovered through Genetic Programming (GP). While Simple Priority Rules (SPR) have been widely applied in ...
IJCNN
2006
IEEE
15 years 3 months ago
2006
IEEE
— We introduce in this paper methods for finding mutually corresponding dependent components from two different but related data sets in an unsupervised (blind) manner. The basi...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In this paper, we propose a general cross-layer optimization framework in which we explicitly consider both the heterogeneous and dynamically changing characteristics of delay-sens...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function’s parameters for computer chess. Our results show that using an approp...