We investigate topological aspects in Genetic Algorithms (GAs). Two dimensional combinatorial optimization problems, cell placement problems, are concerned. We construct topological recombination and uniform recombination based on exchange operations, and compare their performance. Simulation

, in the languages that are familiar to topologists and differential geometers, many topological interpretations of Chow quotient that have the advantage to be more intuitive and geometric. More precisely, over the field of complex numbers, these interpretations are, symplectically, the moduli spaces of stable

Abstract not found

Abstract. We explore possibilities and limitations of a purely topological approach to the Dvoretzky Theorem.

Abstract not found

1 Introduction Recent work in mathematical logic [8, 9, 10] has led to an interest in certain topological spaces formed from filters on partially ordered sets. This paper describes the general topology of these poset spaces.

In this survey we present the interplay between topological dynamical systems theory with network flow theory in order to obtain a continuation result for abstract Lyapunov graphs L(h0; : : : ; hn; ·) in dimension n with cycle number ·. We also show that an abstract Lyapunov graph satisfies

This paper is a little mathematical study of some models of concurrency. The most elementary one is the concept of an independence structure, which is nothing but a set L with a binary, irreflexive and symmetric rlation on it, the independence relation. This leads to the notion of a trace: a string of elements of L, modulo the equivalence generated by swapping adjacent, independent elements of the string

: We establish a number of new results (and rederive some old results) concerning regular languages, using essentially topological methods. Our development is based on the duality (established by Stone) between Boolean algebras and certain topological spaces (which are now called "Stone spaces

non-Abelian gauge theory