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 problems. In this paper we propose a criterion to…

Images compression is a widely studied topic. Conventional situations offer variable compression ratios depending on the image in question and, in general, do not yield good results for images that are rich in tones. This work is an application of…

Implicitly exploitable parallelism for Logic Programming has received ample attention. Defeasible Argutmentation is specially apt for this optimizing technique. Defeasible Logic Programming (DLP), which is based on a defeasible argumentation formalism, could take full advantage of this type of parallel…

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 by classes) individuals are grouped according to their fitness. The…

This paper presents an Ant Colony Optimisation (ACO) model for the Multiple Knapsack Problem (MKP). The ACO algorithms, as well as other evolutionary metaphors, are being applied successfully to diverse heavily constrained problems: Travelling Salesman Problem, Quadratic Assignment Problem and…

In this paper we define an evolution mechanism with formal semantics using the metamodeling methodology [Geisler et al.98] based on dynamic logic. A remarkable feature of the metamodeling methodology is the ability to define the relation of intentional and extensional…

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 traditional approaches which improve a single solution. All these…

Interactive visualisation of triangulated terrain surfaces is still a problem for virtual reality systems. A polygonal model of very large terrain data requires a large number of triangles. The main problems are the representation rendering efficiency and the transmission over…

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 be extended to multiobjective optimization, simulation of complex systems…

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 extra benefit in processing time and similar quality of…