Buscar recursos académicos

As a new promising crossover method, multiple crossovers per couple (MCPC) deserves special attention in evolutionary computing field. Allowing multiple crossovers per couple on a selected pair of parents provided an ext...

Minimization of query execution time is an important performance objective in distributed databases design. While total time is to be minimized for On Line Transaction Processing (OLTP) type queries, response time has to...

"What should be the sensing capabilities of agents in a Multi-Agent System be to solve a problem efficiently, quickly and economicly? This question often appears when trying to solve a problem using Multi-Agent Systems. ...

"We study the dynamics of self-organized systems when disturbed by shocks. For this purpose, we consider extensions of the “Bar Attendance Model” [1] (BAM), which provides a stylized setting for the analysis of the e...

Our interest is to define evolutionary algorithms to solve Constraint Satisfaction Problems (CSP), which indlude benefits of taditional resolution methods of CSPs as well as inherent characteristics of these kind of prob...

Evolutionary computation (EC) has been recently recognized as a research field, which studies a new type of algorithms: Evolutionary Algorithms (EAs). These algorithms process populations of solutions as opposed to most ...

This paper presents a neuro-fuzzy network where all its parameters can be tuned simultaneously using Genetic Algorithms. The approach combines the merits of fuzzy logic theory, neural networks and genetic algorithms. The...

Evolutionary computation (EC) has been recently recognized as a research field, which studies a new type of algorithms: Evolutionary Algorithms (EAs). These algorithms process populations of solutions as opposed to most ...

This work is focussed on the development and analysis of a new class of algorithms, called cellular memetic algorithms (cMAs), which will be evaluated here on the satisfiability problem (SAT). For describing a cMA, we st...

Migration of individuals allows a fruitful interaction between subpopulations in the island model, a well known distributed approach for evolutionary computing, where separate subpopulations evolve in parallel. This mode...

Three alternatives within the method of assignment by classes are presented for the calculation of individuals lifetime in genetic algorithms with varying population size. (GAVaPS). In the proposed strategy (assignment b...

Niche formation allows evolutionary algorithms to be used when the location and maintenance of multiple solutions appertaining to diverse areas of the phenotypic space is required. Consequently the application field can ...

Non-stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. The concept of dynamic environments in the context of this paper means that the fitness landscape changes during the run...

Clustering task aims at the unsupervised classification of patterns (e.g., observations, data, vec- tors, etc.) in different groups. Clustering problem has been approached from different disciplines during the last years...

Mobile robot's navigation and obstacle avoidance in an unknown and static environment is analyzed in this paper. From the guidance of position sensors, artificial neural network (ANN) based controllers settle the desired...