We discuss a theory for a realistic, applicable scaled genetic algorithm (GA) which converges asymptoticly to global optima in a coevolutionary setting involving two species. It is...
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
For a quantale V, first a closure-theoretic approach to completeness and separation in V-categories is presented. This approach is then generalized to T-categories, where T is a to...
When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
Abstract-- The dual notions of discernibility and indiscernibility play an important role in intelligent data analysis. While discernibility focuses on the differences, the indisce...