Optimal Recombination in Genetic Algorithms

This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. We consider efficient reductions of the ORPs, allowing to establish polynomial solvability or NP-hardness of the ORPs, as well as direct proofs of hardness results

Metric characterization of cluster dynamics on the Sierpinski gasket

We develop and implement an algorithm for the quantitative characterization of cluster dynamics occurring on cellular automata defined on an arbitrary structure. As a prototype for such systems we focus on the Ising model on a finite Sierpsinski Gasket, which is known to possess a complex thermodynamic behavior. Our algorithm requires the projection of evolving configurations into an appropriate partition space, where an information-based metrics (Rohlin distance) can be naturally defined and worked out in order to detect the changing and the stable components of clusters. The analysis highlights the existence of different temperature regimes according to the size and the rate of change of clusters. Such regimes are, in turn, related to the correlation length and the emerging "critical" fluctuations, in agreement with previous thermodynamic analysis, hence providing a non-trivial geometric description of the peculiar critical-like behavior exhibited by the system. Moreover, at high temperatures, we highlight the existence of different time scales controlling the evolution towards chaos.Comment: 20 pages, 8 figure

On the dynamics of the glass transition on Bethe lattices

The Glauber dynamics of disordered spin models with multi-spin interactions on sparse random graphs (Bethe lattices) is investigated. Such models undergo a dynamical glass transition upon decreasing the temperature or increasing the degree of constrainedness. Our analysis is based upon a detailed study of large scale rearrangements which control the slow dynamics of the system close to the dynamical transition. Particular attention is devoted to the neighborhood of a zero temperature tricritical point. Both the approach and several key results are conjectured to be valid in a considerably more general context.Comment: 56 pages, 38 eps figure

Semantic 3D Reconstruction with Finite Element Bases

We propose a novel framework for the discretisation of multi-label problems on arbitrary, continuous domains. Our work bridges the gap between general FEM discretisations, and labeling problems that arise in a variety of computer vision tasks, including for instance those derived from the generalised Potts model. Starting from the popular formulation of labeling as a convex relaxation by functional lifting, we show that FEM discretisation is valid for the most general case, where the regulariser is anisotropic and non-metric. While our findings are generic and applicable to different vision problems, we demonstrate their practical implementation in the context of semantic 3D reconstruction, where such regularisers have proved particularly beneficial. The proposed FEM approach leads to a smaller memory footprint as well as faster computation, and it constitutes a very simple way to enable variable, adaptive resolution within the same model