9947181
The Influence of Learning in the Evolution of Busy Beavers
The goal of this research is to study how individual learning interacts with an evolutionary algorithm in its search for good candidates for the Busy Beaver problem. Two learning models, designed to act as local search procedures, are proposed. Experimental results show that local search methods that are able to perform several modifications in the structure of an individual in each learning step provide an important advantage. Some insight about the role that evolution and learning play during search is also presented.
8920330
On the Evolution of Evolutionary Algorithms
In this paper we discuss the evolution of several components of a traditional Evolutionary Algorithm, such as genotype to phenotype mappings and genetic operators, presenting a formalized description of how this can be attained. We then focus on the evolution of mapping functions, for which we present experimental results achieved with a meta-evolutionary scheme.
12781827
On the influence of GVR in vehicle routing
A comparative study is made between a new evolutionary approach for the Vehicle Routing Problem (VRP) and a standard evolutionary model, based on Path Representation. Genetic Vehicle Representation (GVR) is the new two-level representational scheme designed to deal in an effective way with all the information needed by candidate solutions. Experimental results, obtained from a set of VRP instances, show performance improvements when GVR is used.
42460508
Probabilistic Evolution and the Busy Beaver Problem
2344862
Busy Beaver - The Influence of Representation
The Busy Beaver is an interesting theoretical problem proposed by Rado in 1962, in the context of the existence of non computable functions. In this paper we propose an evolutionary approach to this problem. We will focus on the representational issues, proposing alternative ways of codifying and interpreting Turing Machines, designed to take advantage of the existence of sets of equivalent Turing Machines. The experimental results show that these alternatives provide improvement over the "standard" genetic codification.
10111787
Golomb Rulers: The Advantage of Evolution
In this paper we present a new evolutionary algorithm designed to efficiently search for optimal Golomb rulers. The proposed approach uses a redundant random keys representation to codify the information contained in a chromosome and relies on a simple interpretation algorithm to obtain feasible solutions. Experimental results show that this method is successful in quickly identifying good solutions and that can be considered as a realistic alternative to massive parallel approaches that need several months or years to discover high quality Golomb rulers.
11219736
Combining Case-Based Reasoning and Analogical Reasoning in Software Design
Designers use several types of knowledge and reasoning mechanisms during the creation of new artefacts. In order to cope with this cognitive characteristic of design, an intelligent design tool able to help a designer must integrate several reasoning mechanisms and knowledge formats. Case-based reasoning and analogical reasoning are usually considered as two distinct mechanisms, though they are also considered to be in the same cognitive axis, case-based reasoning being in one extreme, and analogy in the other. Both are important reasoning mechanisms in the generation of new designs, but they both reflect different ways of exploring the design space. In this paper we present a way of combining both techniques, showing how it was integrated in an intelligent software design tool. Experimental results are presented and discussed, showing the advantages and limitations of this approach.
10585259
Three-phase immiscible displacement in heterogeneous petroleum reservoirs
We describe a fractional-step numerical procedure for the simulation of immiscible three-phase flow in heterogeneous porous media that takes into account capillary pressure and apply it to indicate the existence of a so-called "transitional" wave in at least some multi-dimensional flows, thereby extending theoretical results for one-dimensional flows. The step procedure combines a second-order, conservative central difference scheme for a pertinent system of conservation laws modeling the convective transport of the fluid phases with locally conservative mixed finite elements for the associated parabolic and elliptic problems.
30550943
Reuse of UML Class Diagrams Using Case-Based Composition
1469013
Solution Verification in Software Design: A CBR Approach
Software design is becoming a demanding task, not only because the complexity of software systems is increasing, but also due to the pressure that development teams suffer from clients. CASE tools capable of performing more work and of having more intelligent abilities are needed, so that, they can provide more help to the designer. In this paper we describe a CASE tool capable of assisting the designer in a more intelligent way, be it by suggesting new solutions or by learning user preferences. We detail how the solutions are generated and focus on the verification process, which enables the new designs to have less errors. This verification process takes a CBR approach, which has the advantage of being personalized. We describe experimental results that show the effect of the verification process in the generated solutions.
15250271
Evaluation of Case-Based Maintenance Strategies in Software Design
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm can not cope with such an amount of cases. Redundancy can also be a problem, focusing retrieval alternatives in a very restricted search space. Basically, the system's performance starts to degrade with the increase of the case-base size. Case-base maintenance allows CBR systems to deal with this problem, mainly through the use of case selection criteria. In this paper we present an experimental study about several case-base maintenance policies developed till now. We adapted and implemented these policies to a CBR system for software reuse and design, testing the applicability of these policies to cases with a complex representation (combination of tree and graph representations).