GECCO
2008
Springer
13 years 9 months ago
2008
Springer
The realization of a control unit can be done using a complex circuitry or microprogramming. The latter may be considered as an alternative method of implementation of machine ins...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
In order to solve nonstationary optimization problems efficiently, evolutionary algorithms need sufficient diversity to adapt to environmental changes. The dual-population genetic...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
One crucial issue in genetic programming (GP) is how to acquire promising building blocks efficiently. In this paper, we propose a GP method (called GPTM, GP with Tree Mining) whi...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
This paper compares three common evolutionary algorithms and our modified GA, a Distributed Adaptive Genetic Algorithm (DAGA). The optimal approach is sought to adapt, in near rea...