This article introduces the concept of variable chromosome lengths in the context of an adaptive genetic algorithm (GA). This concept is applied to structural topology optimization with large numbers of design variables. In traditional genetic algorithms, the chromosome length is determined when the phenotype is encoded into a genotype. Subsequently, the chromosome length does not change. This ...

Packet classification continues to be an important challenge in network processing. It requires matching each packet against a database of rules and forwarding the packet according to the highest priority matching rule. Within the packet classification hash-based algorithms, an algorithm that is gaining interest is the tuple space search algorithm that groups the rules into a set of tuple space...

Il Yong KIM* Olivier DE WECK Dept. of Mechanical and Materials Engineering, Queen’s University, Canada Dept. of Aeronautics and Astronautics and Engineering Systems Division, MIT, USA Abstract This article introduces the concept of variable chromosome lengths in the context of an adaptive genetic algorithm (GA). This concept is applied to structural topology optimization with large numbers of d...

For every filter F on N, we introduce and study corresponding uniform F-boundedness principles for locally convex topological vector spaces. These generalise the classical boundedness sequences of continuous linear maps by coinciding with these when equals Fréchet cofinite subsets N. We determine combinatorial properties which ensure that hold space. Furthermore, several types spaces, also isol...

An ensemble particle filter is proposed which is suitable for very large systems with smooth state, such as arizing from discretization of partial differential equations. The proposal ensemble comes from an arbitrary unknown distribution, and it is selected to have a good coverage of the support of the posterior. Proposal ensembles from the ensemble Kalman filter and from deterministic nudging ...