Abstract- The Maximum Homologous Crossover attempts to preserve similar structures from parents by aligning them according to their homology. In this paper, it is successfully test...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...
Abstract— We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for prod...
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
This paper presents a new approach to guaranteed state estimation for nonlinear discrete-time systems with a bounded description of noise and parameters. The sets of states that a...
T. Alamo, J. M. Bravo, M. J. Redondo, Eduardo F. C...
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...