Abstract. The paper presents methods for model checking a class of possibly infinite state concurrent programs using various types of bi-simulation reductions. The proposed method...
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
Abstract. We demonstrate a fully automated method for obtaining a closedform approximation of a recursive function. This method resulted from a realworld problem in which we had a ...
This work presents a performance analysis of a Multi-Branches Genetic Programming (MBGP) approach applied in symbolic regression (e.g. function approximation) problems. Genetic Pro...
It is possible for a GA to have two stable fixed points on a single-peak fitness landscape. These can correspond to meta-stable finite populations. This phenomenon is called bis...