The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper reports a comparison of several bloat control methods and also evaluates a new proposal for limiting the size of the individuals: a genetic operator called prune and plant. The aim of this work is to prove the adequacy of this new method. Since a preliminary study of the method has already shown promising results, we have performed a thorough study in a set of benchmark problems aiming...
The isin-DANTE method is an hybrid meta-heuristic. In combines the evolutionary ant colony optimization (ACO) algorithms with a limited depth search. This depth search is based in the pheromone trails used by the ACO, which allows it to be oriented to the more promising areas of the search space. Some results are presented for the multiple objective k-degree spanning trees problem, proving the effectiveness...
The requirements imposed on information retrieval systems are increasing steadily. The vast number of documents in today's large databases and especially on World Wide Web causes notable problems when searching for concrete information. It is difficult to find satisfactory information that accurately matches user information needs even if it is present in the database. One of the key elements when...
In this paper we present an application of the grouping genetic algorithm to the problem of assigning students to laboratory groups in university courses. This problem includes an important constraint of capacity, due to laboratories usually have a maximum number of equips or computers available, so the number of total students in a group is constrained to be equal or less than the capacity of the...
Common evolutionary approaches to protein-ligand docking optimization use mutation operators based on Gaussian and Cauchy distributions, with local search hybrids. The choice of a local search method is important for an efficient algorithm. We investigate the impact of local search with mutation operators by performing a locality analysis. High locality means that small variations in the genotype...
This paper investigates the behavior of the adaptive dissortative mating genetic algorithm (ADMGA) on dynamic problems and compares it with other genetic algorithms (GA). ADMGA is a non-random mating algorithm that selects parents according to their Hamming distance, via a self-adjustable threshold value. The resulting method, by keeping population diversity during the run, provides new means for...
The harmony search (HS) method is an emerging meta-heuristic optimization algorithm. In this paper, we propose two modified HS methods to deal with the uni-modal and multi-modal optimization problems. The first modified HS method is based on the fusion of the HS and differential evolution (DE) technique, namely, HS-DE. The DE is employed here to optimize the members of the HS memory. The second modified...
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given a salesman who has to visit a number of cities to carry out some business. He starts and ends at a specified home city, and the required time for the overall journey, including waiting times, shall be minimized. In this paper,...
During the last decades a lot of work has been devoted to develop algorithms that can provide near-optimal solutions for the capacitated vehicle routing problem (CVRP). Most of these algorithms are designed to minimize an objective function, subject to a set of constraints, which typically represents aprioristic costs. This approach provides adequate theoretical solutions, but they do not always fit...
Genetic network programming (GNP), one of the extended evolutionary algorithms was proposed, whose gene is constructed by the directed graph. GNP can perform a global searching, but it lacks of the exploitation ability. Since the behavior of GNP is characterized by the balance between exploitation and exploration in the search space, we proposed a hybrid algorithm in this paper that combines GNP with...
A neurogenetic approach is presented for solving constrained nonlinear convex optimization problems with joint and disjoint feasible regions. More specifically, a modified Hopfield neural network is associated with a genetic algorithm in order to treat optimization and constraint terms in different stages with no interference with each other. Under the condition that the objective function is convex...
This paper presents a hardware implementation in a FPGA circuit of an efficient encryption algorithm based on hybrid additive programmable cellular automata (HAPCA). We present a novel approach for a high-speed encryption system prototyped using a single FPGA. The approach is based upon a one-dimensional HAPCA architecture. A regular, modular, and cascadable hardware implementation of the cellular...
Simulating the realistic behavior of large crowds of autonomous agents is still a challenge for the computer graphics community. In order to handle large crowds, some scalable architectures have been proposed. Nevertheless, the effective use of distributed systems requires the use of partitioning methods that can properly assign different sets of agents to the existing distributed resources. In this...
The joined travelling of vehicles is an important instrument of cost reduction in the innovative RailCab concept. While the problem of joining groups of vehicles into convoys and determining convoy routes can be easily understood as optimization problem, the distributed nature and large number of vehicles and stops inhibits the direct application of operations research methods and problems. In this...
An evaluation method of human visual impressions in gray scale textures using morphological morphology is proposed. Variations of textures are generated by modifying repetitively arranged objects and configurations of the arrangements of original textures. The variations are presented to human respondents, and similarity of modified textures based on human impressions is evaluated. The results of...
Pressure ulcer is a clinical pathology of localized damage to the skin and underlying tissue caused by pressure, shear o friction. Diagnosis, treatment and care of pressure ulcers involve high costs for sanitary systems. Accurate wound evaluation is a critical task for optimizing the effectiveness of treatments and care. Clinicians usually evaluate each pressure ulcer by visual inspection of the damaged...
This paper presents a new model to realize a supervised image segmentation task. It is based on the concept of receptive fields that intends to analyze pieces of an image considering not only the pixels or group of them, but also the relationship between them and their neighbors, called segmentation and classification with receptive fields (SCRF). Also, in order to work with the SCRF model, is proposed...
Online adaptation is a key requirement for image processing applications when used in dynamic environments. In contrast to batch learning, where retraining is required each time a new observation occurs, sequential learning algorithms offer the ability to iteratively adapt the existing classifier. In this paper, we present a neural network architecture and a fast online learning algorithm that allow...
To develop truly autonomous mobile robots, we propose to introduce internal rewards such as the desire for existence, specific curiosity, diversive curiosity, boredom, and novelty into reinforcement learning. They are expected to make mobile robots capable of behaving appropriately without being told what to do. Firstly, we propose to use multiple sources of rewards to endow mobile robots with ability...
This paper presents the results of experiments in applying a spiking neural network to control the locomotion of a simulated biped robot. The neural model used in simulations was developed to allow for an analytic solution to a neuron's fire time, while maintaining a non-instant post-synaptic potential rise time. The synaptic weights and delays were tuned using an evolution-strategy. Simulation experiments...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.