Subset Feature Selection problems can have several attributes which may make Messy Ge netic Algorithms an appropriate optimization method First competitive solutions may of ten use only a small percentage of the total available features this can not only o er an advantage to Messy Genetic Algorithms it may also cause problems for other types of evolutionary algorithms Second the evalu ation of ...

A Messy Genetic Algorithm is customized toflnd’optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which chromosome length can vary. Consequently, population dynamics can be made to drive a relatively efficient and robust search for larger and better matches. Run-times for the Messy GA are as much as an order of magnitude sma...

We present a new submodel for the Modular Earth Submodel System (MESSy): the MiXed Layer (MXL) model for the diurnal dynamics of the convective boundary layer, including explicit representations of entrainment and surface fluxes. This submodel is embedded in a new MESSy base model (VERTICO), which represents a single atmospheric column. With the implementation of MXL in MESSy, MXL can be used i...

For natural selection to progress, there must be a sufficiently large evolutionary space to explore. In systems with template-based replication, this space is combinatorially large in the length of the information-carrying molecules. Previous work has shown that it is also possible for heredity to occur in much less structured chemistries; this opens the question of how the structure of a react...

Current studies of “messy” broadcasting have so far concentrated on finding worst-case times. However, such worst-case scenarios are extremely unlikely to occur in general. Hence, determining average-case times or tight upper bounds for completing “messy” broadcasting in various network topologies is both necessary and meaningful in practice. In this paper, we focus on seeking the average-case ...