Dissertação de Mestrado em Engenharia Informática apresentada à Faculdade de Ciências e Tecnologia da Universidade de CoimbraEvolutionary Algorithms (EA) are a family of search heuristics from the area of Arti- cial Intelligence. They have been successfully applied in problems of learning, optimization and design, from many application domains. Currently, they are divided into two families, Genetic Algorithms (GA) and Genetic Programming (GP). Genetic Algorithms evolve solutions for a speci c problem. On the other hand, Genetic Programming evolves programs that, when executed, produce the solutions for speci c problems. Many of the successful applications of EAs have been on static environments, i.e., environments whose conditions r...
Non-stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. T...
Genetic programming (GP) is an automated method for creating a working computer program from a high-...
If the optimization problem is dynamic, the goal is no longer to find the extrema, but to track thei...
Genetic algorithms perform an adaptive search by maintaining a population of candidate solutions tha...
This paper surveys strategies applied to avoid premature convergence in Genetic Algorithms (GAs).Gen...
The ability to track the optimum of dynamic environments is important in many practical applications...
Evolutionary algorithm (EA) is an umbrella term used to describe population-based stochastic direct ...
Genetic programming is a promising variant of genetic algorithms that evolves dynamic, hierarchical ...
Genetic algorithms provide an alternative to traditional optimization techniques by using directed r...
It is a matter of fact that in Europe evolution strategies and in the U.S.A. genetic algorithms have...
Optimisation is a challenging research topic that relates to most real-life applications, such as tr...
Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solv...
We present a study of dynamic environments with genetic programming to ascertain if a dynamic enviro...
We review different techniques for improving GA performance. By analysing the fitness landscape, a c...
Non-stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. T...
Non-stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. T...
Genetic programming (GP) is an automated method for creating a working computer program from a high-...
If the optimization problem is dynamic, the goal is no longer to find the extrema, but to track thei...
Genetic algorithms perform an adaptive search by maintaining a population of candidate solutions tha...
This paper surveys strategies applied to avoid premature convergence in Genetic Algorithms (GAs).Gen...
The ability to track the optimum of dynamic environments is important in many practical applications...
Evolutionary algorithm (EA) is an umbrella term used to describe population-based stochastic direct ...
Genetic programming is a promising variant of genetic algorithms that evolves dynamic, hierarchical ...
Genetic algorithms provide an alternative to traditional optimization techniques by using directed r...
It is a matter of fact that in Europe evolution strategies and in the U.S.A. genetic algorithms have...
Optimisation is a challenging research topic that relates to most real-life applications, such as tr...
Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solv...
We present a study of dynamic environments with genetic programming to ascertain if a dynamic enviro...
We review different techniques for improving GA performance. By analysing the fitness landscape, a c...
Non-stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. T...
Non-stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. T...
Genetic programming (GP) is an automated method for creating a working computer program from a high-...
If the optimization problem is dynamic, the goal is no longer to find the extrema, but to track thei...